Knight's Tour/Solution 1

Problem

How can a chess knight make a complete tour of the chessboard,

visiting each square once and once only,
and ending up a knight's move from its starting square

so that its circuit is continuous?


Solution


Sources

  • 1992: David Wells: Curious and Interesting Puzzles ... (previous) ... (next): The Knight's Tour: $132$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.