Problem #PRU-97939

Problems Algebra and arithmetic Word problems Tables and tournaments Chessboards and chess pieces Set theory and logic Theory of algotithms Game theory

Problem

Two play a game on a chessboard \(8 \times 8\). The player who makes the first move puts a knight on the board. Then they take turns moving it (according to the usual rules), whilst you can not put the knight on a cell which he already visited. The loser is one who has nowhere to go. Who wins with the right strategy – the first player or his partner?