Values of n that the second player has a winning strategy
Source: Tournament of Towns Spring 2003 - Junior O-Level - Problem 2
June 14, 2011
inductioncombinatorics unsolvedcombinatorics
Problem Statement
Two players in turns color the sides of an -gon. The first player colors any side that has or common vertices with already colored sides. The second player colors any side that has exactly common vertex with already colored sides. The player who cannot move, loses. For which the second player has a winning strategy?