Taming the knight's tour: minimizing turns and crossings

DOI10.1016/j.tcs.2021.12.002OpenAlexW4205882584MaRDI QIDQ2067620

Yanyan Li

Publication date: 18 January 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.02824

zbMATH Keywords

chessHamiltonian cyclegraph drawingapproximation algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• GVF

Cites Work

• Improved lower bounds for the link length of rectilinear spanning paths in grids
• Generalised knight's tours
• Which chessboards have a closed knight's tour within the rectangular prism?
• An efficient algorithm for the Knight's tour problem
• Minimum-link watchman tours
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• A characterization of the minimum cycle mean in a digraph
• Solution of the knight's Hamiltonian path problem on chessboards
• Bounds on the number of knight's tours
• Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards
• The closed knight tour problem in higher dimensions
• Which chessboards have a closed knight's tour within the cube?
• Generalized knight's tours on rectangular chessboards
• Which Rectangular Chessboards Have a Knight's Tour?
• Knight's Tours on a Torus
• A method for finding Hamilton paths and Knight's tours
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Taming the knight's tour: minimizing turns and crossings