Bounds on the number of knight's tours

Discrete Applied Mathematics

Volumn 74, Issue 2, 1997, Pages 171-181

  Kyek, Olaf ^a   Parberry, Ian ^b   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Counting; Graph theory; Hamiltonian paths

Indexed keywords

EID: 0041633414     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00031-5     Document Type: Article

References (10)

1. A. Conrad, T. Hindrichs, H. Morsy and I. Wegener, Solution of the knight's Hamiltoman path problem on a chessboard, Discrete Appl. Math. 50 (1994) 125-134.
2. L. Euler. Solution d'une question curieuse qui ne parait soumise à aucune analyse, Mémoire de l'Académie Royale des Sciences XV, Berlin (1759) 310-337.
3. M. Kraitschik, Mathematical Recreations (Ch. 11. The problem of the knight) (Dover Publications, New York, 1953).
4. A.M. Legendre. Théorie des Nombres (Paris, 1830).
5. Minding, Cambridge Dublin Math. J. 7 (1852) 147-156.
6. I. Parberry, Algorithms for touring knights, Technical Report University of North Texas (1994).
7. P.M. Roget, Philos. Mag. 3 XVI (1840) 305-309.
8. P.G. Tait, Listing's topology, Philos. Mag. 17 (1884) 30-46.
9. A.T. Vandermonde, L'Histoire de l'Académie des Sciences 1771, Paris (1774) 566-574.
10. H.C. Warnsdorff, Des Rösselsprunges einfachste und allgemeinste Lösung, Schmalkalden (1823).