The knight's journey

Estragon is correct. Just Google "knight's tour" and you find many different solutions. Here's one page that shows a few solutions:
http://www.edcollins.com/chess/knights-tour.htm
Estragon is correct. Just Google "knight's tour" and you find many different solutions. Here's one page that shows a few solutions:
http://www.edcollins.com/chess/knights-tour.htm
There is an old puzzle called knight's journey: How can a knight pass all the squares on chess board by 63 moves? Does anyone have a soloution or idea for this? I know neither its soloution nor its answer! But I ask you to think about it.