Knights Tour Solution
To
set your start position - Click on any square;
then click [next] for a step by step walk through
or [solve] for complete solution
then click [next] for a step by step walk through
or [solve] for complete solution
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?"
May 2006