# 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

This theorem requires a proof.In particular: Haven't even started the definitions yet for chess problemsYou can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{ProofWanted}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Sources

- 1986: David Wells:
*Curious and Interesting Numbers*... (previous) ... (next): $30$ - 1997: David Wells:
*Curious and Interesting Numbers*(2nd ed.) ... (previous) ... (next): $30$