This shows a knight's tour starting from any position on a chess board. A classic chess problem is to find a sequence of moves such that a knight will land on every square exactly once. First position the knight anywhere on the board. Then drag the slider to see a knight's tour, either as a broken line path or by numbering the squares in order.
![[Snapshot]](HTMLImages/index.en/thumbnail_1.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_2.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_3.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_4.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_5.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_6.gif)
Embed Interactive Demonstration 
Browse all topics
