Generalized knight's tour on 3D chessboards
From MaRDI portal
Publication:602746
DOI10.1016/j.dam.2010.07.009zbMath1222.05140OpenAlexW2091750106MaRDI QIDQ602746
Gui-Bin Zhu, Sen Bai, De-Lei Jiang, Xiaofan Yang, Jian Huang
Publication date: 5 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.009
Related Items
A tour problem on a toroidal board, Knight's tours on rectangular chessboards using external squares, Tours of a generalized knight on rectangular chessboards
Cites Work
- An efficient algorithm for the Knight's tour problem
- Bounds on the number of knight's tours
- Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards
- Generalized knight's tours on rectangular chessboards
- Which Rectangular Chessboards Have a Knight's Tour?
- Unnamed Item
- Unnamed Item