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.