Which Rectangular Chessboards Have a Knight's Tour?
From MaRDI portal
Publication:4013176
DOI10.2307/2690649zbMath0761.05041OpenAlexW4212834294MaRDI QIDQ4013176
Publication date: 27 September 1992
Full work available at URL: https://doi.org/10.2307/2690649
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (20)
Algorithms for finding knight's tours on Aztec diamonds ⋮ Generating Hamiltonian circuits without backtracking from errors ⋮ Generalized knight's tour on 3D chessboards ⋮ The traveling salesman problem on grids with forbidden neighborhoods ⋮ Book review of: J. Sesiano, Euler et le parcours du cavalier. Avec une annexe sur le théorème des polyèdres ⋮ Generalised knight's tours ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A closed -knight’s tour on some cylinder chessboards ⋮ An efficient algorithm for the Knight's tour problem ⋮ Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards ⋮ Knight's tours on rectangular chessboards using external squares ⋮ Queens, attack! ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Taming the knight's tour: minimizing turns and crossings ⋮ Generalized knight's tours on rectangular chessboards ⋮ Closed knight’s tour problem on some (m,n,k,1)-rectangular tubes ⋮ Tours of a generalized knight on rectangular chessboards ⋮ Leaper Tours
This page was built for publication: Which Rectangular Chessboards Have a Knight's Tour?
