The Knight's Tour

​
step
5
path type
line
numbers
A classic chess problem is to find a sequence of knight moves that visits each square exactly once. Start by placing the knight anywhere on the board, then drag the step slider to see a knight's tour, either as a broken line path or by numbering the squares in order.

Details

Based on and extending a program at Knight's tour.

External Links

Knight Graph (Wolfram MathWorld)

Permanent Citation

Jay Warendorff
​
​"The Knight's Tour"​
​http://demonstrations.wolfram.com/TheKnightsTour/​
​Wolfram Demonstrations Project​
​Published: April 27, 2007