Area of Smallest Rectangle accommodating Re-Entrant Knight's Tour
Jump to navigation
Jump to search
Theorem
The area of the smallest rectangular chessboard on which a re-entrant knight's tour is possible is $30$ squares.
This can be configured either as a $5 \times 6$ chessboard or a $3 \times 10$ chessboard.
Proof
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $30$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $30$