Do you know how to do the Knight’s Tour?
About Knight’s Tour Problem…
The Knight’s Tour Problem was first introduced over 200 years ago, by the great mathematician Leonhard Euler.
He simply asked, “Would it be possible for a chess knight to travel the entire chessboard (assuming legal L-shaped chess moves), so that each and every square is visited exactly once?”
Chess Daily News from Susan Polgar
Way too difficult.
The page doesn’t render — i.e. is shown at all — in the Chrome browser. A good page about the knight’s tour can be found here: http://mathworld.wolfram.com/KnightGraph.html
Yes, the picture shown (with numbreed squares) is a solution; but there are better, “circular”, solutions, where the Knight’s tour ends at Knight’s distance of where it began (i.e. with squares 64 and 1 at Knight’s distance of each other).