January 27–February 2, 2009
n points are marked on a circle. Two players take turns connecting them with line segments. Each new segment must be connected with the previous one, and it is not allowed to draw the same segment twice. The first player unable to make a segment loses.
Which player has a winning strategy? Describe the winning strategy.
List of solvers
Matt Inouye, Michael Draper (undergrad); Koopa Koo, Dustin Moody, Justin Shih (graduate); Gary Raymond (staff); Peiyush Jain, Roman Holenstein, Lloyd Sakazaki, Hai Bin Chang, Anand Rajagopalan (outside).
Roman Holenstein wins the prize!