No Knights Attack
Discrete Mathematics
Level
1
Andrew and Benjamin are playing a game on an \( 8 \times 8 \) chessboard. Each turn, they place a knight in a position that isn't threatened by other knights that are already on the board. The first person who is unable to place a knight loses the game.
As an explicit example, the board above shows a possible sequence of 5 turns, where all the squares that are threatened by other knights are marked with red X's.
If Andrew goes first, who will win this game?
by
Chung Kevin