Algorithms for finding knight's tours on Aztec diamonds

DOI10.2140/INVOLVE.2017.10.721MaRDI QIDQ2357657zbMATH OpenOpenAlexFDO

Authors Samantha Davies, Chenxiao Xue, Carl Yerger

Publication date 14 June 2017

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2017.10.721

zbMATH Keywords

algorithmAztec diamondHamiltonianknight's tour

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• Taming the knight's tour: minimizing turns and crossings
• A method for finding Hamilton paths and Knight's tours
• scientific article; zbMATH DE number 599567
• Solution of the knight's Hamiltonian path problem on chessboards

Cites work

• An efficient algorithm for the Knight's tour problem
• Generating random regular graphs
• Knight's Tours on a Torus
• Knight's tours on boards with odd dimensions
• Knight's tours on cylinders and other surfaces
• Which Rectangular Chessboards Have a Knight's Tour?

Cited in

(5)

• Taming the knight's tour: minimizing turns and crossings
• Two dependent probabilistic chip-collecting games
• A method for calculating the Knight's total tour count
• A method for finding Hamilton paths and Knight's tours
• Taming the knight's tour: minimizing turns and crossings

This page was built for publication: Algorithms for finding knight's tours on Aztec diamonds

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