TOT 166 1988 Spring Train J3 diagonals connectinb bw vertices of 10-gon game
Source:
May 9, 2020
combinatorial geometrycombinatoricsregular polygonColoringdiagonalgame strategygame
Problem Statement
(a) The vertices of a regular -gon are painted in turn black and white. Two people play the following game . Each in turn draws a diagonal connecting two vertices of the same colour . These diagonals must not intersect . The winner is the player who is able to make the last move. Who will win if both players adopt the best strategy?
(b) Answer the same question for the regular -gon . (V.G. Ivanov)