ANU Computer Science Technical Reports

TR-CS-97-03

Brendan D. McKay.
Knight's tours of an 8 × 8 chessboard.
February 1997.

[POSTSCRIPT (81433 bytes)] [PDF (115238 bytes)] [EPrints archive]

Abstract: We describe a computation that determined the number of knight's tours of a standard chessboard. We also verify Knuth's count of tours with a symmetry. The total number of undirected tours is 13,267,364,410,532 and the number of equivalence classes under rotation and reflection of the board is 1,658,420,855,433.

Technical Reports <Technical-DOT-Reports-AT-cs-DOT-anu.edu.au>

Last modified: Tue May 31 12:55:59 EST 2011