An efficient algorithm for the Knight's tour problem

DOI10.1016/S0166-218X(96)00010-8zbMath0866.68079WikidataQ56069811 ScholiaQ56069811MaRDI QIDQ678854

Ian Parberry

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

zbMATH Keywords

knight's tours

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (8)

Algorithms for finding knight's tours on Aztec diamonds ⋮ Generalized knight's tour on 3D chessboards ⋮ The traveling salesman problem on grids with forbidden neighborhoods ⋮ An efficient algorithm for the Knight's tour problem ⋮ Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards ⋮ Taming the knight's tour: minimizing turns and crossings ⋮ Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes ⋮ Hamiltonian cycle curves in the space of discounted occupational measures

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

This page was built for publication: An efficient algorithm for the Knight's tour problem