Felipe Eizo Hanada

Impartial Games on Graphs: Solving Kayles via Dynamic Programming and Periodicity Properties

This work considers combinatorial games in which two players alternately choose vertices from a finite graph until a winning condition is achieved, and focuses on the well-known game Kayles, in which the selected vertices must form an independent set and the player who makes the last valid move wins.