Maximum Length of Non-Crossing Knight's Tour
Jump to navigation
Jump to search
Theorem
The maximum length of a non-crossing knight's tour on a standard chessboard is $35$ moves.
Proof
 | This theorem requires a proof. In particular: Lots of background material needed first. You 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
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $35$