CHESS
Difficulty level
Easy
The Knight’s Tour
Clarifications
- The knight jumps in an “L” shape. The squares it jumps over do not count as visited.
- No destination square may be repeated.
Place a chess knight on any square of the 3 × 3 grid and make valid jumps to visit as many squares as possible without repeating any destination square.
What is the maximum number of landing squares the knight can visit in a single continuous tour?
Have you solved it?
Enter your answer for this challenge:
Solution and explanation
Square 5 is out of the knight’s reach, and the other eight form a cycle of valid jumps. You can start on different squares and go around it in either direction; here are two options, although there are more solutions.