Problem #PRU-30443

Problems Algorithm Theory Game theory Symmetric strategies Discrete Mathematics

Problem

Two people take turns placing knights on a chessboard such that the knights 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?