Area of Smallest Rectangle accommodating Re-Entrant Knight's Tour
Jump to navigation
Jump to search
This theorem requires a proof.
Haven't even started the definitions yet for chess problems
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
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
Haven't even started the definitions yet for chess problems
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $30$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $30$