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?”
Here is the website which will show you how to do it.
Chess Daily News from Susan Polgar
I remember writing a program to do this. There are multiple solutions to the problem.
An interesting project for a kid/first time programmer!
;^D
in some (starting) positions you only have to move the knight as close to the corners as possible.
It seems to me that this problem is not really as difficult as it is often made out to be. I haven’t spent time on it myself, but since the tour by nature is circular, it is just a matter of memorizing the tour a number of times, then it is quite easy to do it starting from any square on the board. A (relatively!) easy way to impress people with your fantastic memory skills.
There are 13,267,364,410,532 solutions on an 8×8 board.