Problem #PRU-30444

Problems Set theory and logic Theory of algotithms Game theory Symmetric strategies

Problem

Two people take turns placing kings on squares of a \(9 \times 9\) chessboard such that the kings cannot attack each other. The loser is the player who cannot make a move. Which player wins the game, if the right strategy is used?