By K. Ramanraj
"A well-known chess riddle is to lay out a route across the board in such a way that a Knight lands on each square only once. Mathematicians have established that more than 30 million such routes are possible. Although some great minds have worked on this problem over the centuries, so far no one has determined the exact total number."1
The solution given here is one of a smaller sub-set of the millions of possible routes. This route is cyclic, i.e. the Knight returns to the square from which it started the conquest. It is a mystery how many such routes exist.
I would like to thank Mr. K. Vaitheeswaran, who provided a solution to the riddle, which was modified into a cyclic solution, on which this script is based.
____________________
1 Alexei Sokolsky, "Your First Move", Progress Publishers, Moscow, 1977, p.15.
Copyright (C) 2001 K. Ramanraj
Please send your comments on the content of these web pages to ramanraj@vsnl.com
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA