Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards

DOI10.1016/j.dam.2004.11.002zbMath1085.68179OpenAlexW2058686974MaRDI QIDQ1763476

Chung-Liang Wei, Shun-Shii Lin

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.11.002

zbMATH Keywords

Optimal algorithmDivide-and-conquer algorithmKnight's tour problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (3)

Generalized knight's tour on 3D chessboards ⋮ The traveling salesman problem on grids with forbidden neighborhoods ⋮ Taming the knight's tour: minimizing turns and crossings

Cites Work

• An efficient algorithm for the Knight's tour problem
• Solution of the knight's Hamiltonian path problem on chessboards
• 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

This page was built for publication: Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards