Adam Logan

Adam Logan
Logan in 2007
Born1975 (age 49–50)
Kingston, Ontario, Canada
Alma materHarvard University
Princeton University
Scientific career
FieldsMathematics
InstitutionsTutte Institute

Adam Logan (born 1975) is a Canadian mathematician and Scrabble player. He is one of 3 players who have won the World Scrabble Championship twice.[1] In 2005, beating Pakorn Nemitrmansuk of Thailand 3–0 in the final,[2] and in 2025, beating Nigel Richards of New Zealand 4–2 in the final.[3] He is the only player to have won the Canadian Scrabble Championship five times (1996, 2005, 2008, 2013 and 2016). He was also the winner of the 1996 National Scrabble Championship, North America's top rated player in 1997, and the winner of the Collins division of the 2014 North American Scrabble Championship.

Since his competitive career began in 1985, Logan has played nearly 2200 tournament games, compiling a winning percentage of over 68%, and earning over $100,000 in prize money.[4]

As a mathematician, he was a Putnam Fellow in 1992 and 1993.[5] Logan completed his first degree, in mathematics, at Princeton University in 1995 and received a PhD from Harvard University in 1999. He completed his Post-doctoral work at McGill University between 2002 through 2003. From 2008 to 2009, he was employed as a Quantitative Analyst at D. E. Shaw & Co. in New York City. He also worked for the Tutte Institute for Mathematics and Computing in Ottawa, Ontario, Canada.[6][7]

References

  1. ^ Klinkenberg, Marty (2025-11-19). "Ottawa mathematician wins his second Scrabble world championship in 20 years". The Globe and Mail. Retrieved 2025-11-21.
  2. ^ "Standings: Round 24". www.wscgames.com. Retrieved 2019-10-28.
  3. ^ "WESPAC 2025 - WESPA Scrabble Championship in Ghana | International Tournament".
  4. ^ "Adam Logan - Recent Tourneys - cross-tables.com".
  5. ^ Klosinski, Leonard F.; Alexanderson, Gerald L.; Larson, Loren C. (1993). "The Fifty-Third William Lowell Putnam Mathematical Competition". The American Mathematical Monthly. 100 (8): 755–767. doi:10.2307/2324782. ISSN 0002-9890. JSTOR 2324782.
  6. ^ Logan, A; Molloy, M; Pralat, P (28 June 2018). "A variant of the Erdos-Renyi random graph process". arXiv:1806.10975 [math.CO].
  7. ^ Klinkenberg, Marty (19 November 2025). "Ottawa mathematician wins his second Scrabble world championship in 20 years". The Globe and Mail. Retrieved 20 November 2025.
This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.