Optimal algorithms for constructing knight's tours on arbitrary n×m chessboards
Authors:
- 15 March 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 146 (3) , 219-232
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An efficient algorithm for the Knight's tour problemDiscrete Applied Mathematics, 1997
- Solution of the knight's Hamiltonian path problem on chessboardsDiscrete Applied Mathematics, 1994
- The Knight's Tour on the 15-PuzzleMathematics Magazine, 1993
- Which Rectangular Chessboards Have a Knight's Tour?Mathematics Magazine, 1991
- The knight’s tourThe Mathematical Gazette, 1986