Problem #PRU-98605

Problemas Matemáticas Discretas Teoría de Algoritmos Teoría de Juegos Teoría de Juegos (otros)

Problem

Two players in turn paint the sides of an \(n\)-gon. The first one can paint the side that borders either zero or two colored sides, the second – the side that borders one painted side. The player who can not make a move loses. At what \(n\) can the second player win, no matter how the first player plays?