|Knight's Tour Problem: On the Chess Board, starting from any square, the knight has to visit all the squares in exactly 64 moves.|
This applet uses a heuristics to find the path. This heuristics suceeds in 63 start postions and fails in one position.
When you click on show button the Chess Board is displayed. You click on any square and watch whether the tour is completed.
You accelerate or slow down speed of moves by clicking on Faster and Slower buttons. However please note that these will be effective from subsequent attempts.