Generalized knight’s tour on 3D chessboards
Authors:
- Sen BaiSBSen Bai
- Xiao-Fan YangXYXiao-Fan Yang
- Gui-Bin ZhuGZGui-Bin Zhu
- De-Lei JiangDJDe-Lei Jiang
- Jian HuangJHJian Huang
- 28 August 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (16) , 1727-1731
Abstract
No abstract availableKeywords
Funding Information
- NNSFC (90818028)
- NNSFC (10771227)
- Program for New Century Excellent Talent of China (NCET-05-0759)
- Hong Kong Research Grants Council (210508)
This publication has 8 references indexed in Scilit:
- Generalized Knight's Tour Problem and Its Solutions Algorithm2006
- Generalized knight's tours on rectangular chessboardsDiscrete Applied Mathematics, 2005
- Optimal algorithms for constructing knight's tours on arbitrary n×m chessboardsDiscrete Applied Mathematics, 2005
- Bounds on the number of knight's toursDiscrete Applied Mathematics, 1997
- An efficient algorithm for the Knight's tour problemDiscrete Applied Mathematics, 1997
- Scalability of a neural network for the knight's tour problemNeurocomputing, 1996
- Finding knight's tours on an M×N chessboard with O(MN) hysteresis McCulloch-Pitts neuronsIEEE Transactions on Systems, Man, and Cybernetics, 1994
- Which Rectangular Chessboards Have a Knight's Tour?Mathematics Magazine, 1991