Solution of the knight's Hamiltonian path problem on chessboards
From MaRDI portal
Publication:1326749
DOI10.1016/0166-218X(92)00170-QzbMath0793.68113DBLPjournals/dam/ConradHMW94WikidataQ54127250 ScholiaQ54127250MaRDI QIDQ1326749
Tanja Hindrichs, Hussein Morsy, Ingo Wegener, Axel Conrad
Publication date: 8 June 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Generating Hamiltonian circuits without backtracking from errors ⋮ Bounds on the number of knight's tours ⋮ 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 ⋮ A tour problem on a toroidal board ⋮ Taming the knight's tour: minimizing turns and crossings ⋮ Game chromatic number of strong product graphs
Cites Work
This page was built for publication: Solution of the knight's Hamiltonian path problem on chessboards
