An efficient algorithm for the Knight's tour problem
From MaRDI portal
Publication:678854
DOI10.1016/S0166-218X(96)00010-8zbMath0866.68079WikidataQ56069811 ScholiaQ56069811MaRDI QIDQ678854
Publication date: 6 July 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes, An efficient algorithm for the Knight's tour problem, Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards
Cites Work
- An efficient algorithm for the Knight's tour problem
- Neural network computing for knight's tour problems
- Solution of the knight's Hamiltonian path problem on chessboards
- Mesh-Connected Computers with Broadcasting
- Which Rectangular Chessboards Have a Knight's Tour?
- The Knight's Tour on the 15-Puzzle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item