Taming the knight's tour: minimizing turns and crossings

DOI10.4230/LIPICS.FUN.2021.4MaRDI QIDQ6487568zbMATH OpenFDO

Authors Juan Jose Besa, T. L. Johnson, Nil Mamano, Martha Carolina Osegueda

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2021.4

zbMATH Keywords

approximation algorithmschessgraph drawingHamiltonian cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• Bounds on the number of knight's tours
• Algorithms for finding knight's tours on Aztec diamonds
• scientific article; zbMATH DE number 3853116
• scientific article; zbMATH DE number 599567

Cited in

(3)

• Taming the knight's tour: minimizing turns and crossings
• Algorithms for finding knight's tours on Aztec diamonds
• scientific article; zbMATH DE number 637357 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487568)