Two players play on an $8 \times 8$ chessboard. The player who starts the game makes the first move - placing a knight on the board. Then they take turns moving it (according to the usual rules), and it is not allowed to place the knight on a square where it has already been. The player who has no legal moves loses. Who wins with correct play - the starting player or their partner?
Let's divide all the squares into 32 pairs so that the squares in one pair are connected by a knight's move (see the figure).

| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 2 | 1 | 4 | 3 | 6 | 5 | 8 | 7 |
| 10 | 9 | 12 | 11 | 14 | 13 | 16 | 15 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 |
| 18 | 17 | 20 | 19 | 22 | 21 | 24 | 23 |
| 26 | 25 | 28 | 27 | 30 | 29 | 32 | 31 |

No matter where the first player places the knight on their turn, the second player moves it to the paired square. Therefore, the second player will always have a move and cannot lose.

## Answer

Partner.