The Knight's Tour

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.


Based on and extending a program at Knight's tour.
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+