2 player game, moving a chips along vertices of a regular n-gon
Source: 2019 XXII All-Ukrainian Tournament of Young Mathematicians named after M. Y. Yadrenko, Qualifying p17
May 24, 2022
geometrycombinatorial geometrycombinatoricsgame strategygamecombinatorial game theoryUkrainian TYM
Problem Statement
points are marked on the board points that are vertices of the regular -gon. One of the points is a chip. Two players take turns moving it to the other marked point and at the same time draw a segment that connects them. If two points already connected by a segment, such a move is prohibited. A player who can't make a move, lose. Which of the players can guarantee victory?