Bounds on the number of knight's tours
β
Olaf Kyek; Ian Parberry; Ingo Wegener
π
Article
π
1997
π
Elsevier Science
π
English
β 726 KB
Knight's tours are a fascinating subject. New lower bounds on the number of knight's tours and structured knight's tours on n x IZ chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.