Genetic Algorithms Demo
This highly parameterized GeneticApplet demonstrates the use of GAs to find a one-way path of a chess knight to visit all squares on the board.
GAs are excellent in finding near-optimum solutions very quickly compared to analytical solutions. As such, this example only succeeds in visiting about 55-59 squares.
An analytical back-tracking method is also provided for comparison. This method use heuristics (hints) to find the optimum solution (visiting all 64 squares) quickly (10sec), and about two days without the heuristics.
Finally, why not try to solve it manually yourself.