scientific article; zbMATH DE number 3853116

MaRDI QIDQ3322131zbMATH OpenFDO

Authors Roger B. Eggleton, Abdul Eid

Publication date 1984

zbMATH Keywords

generalized chessboardsHamiltonian pathknight's circuitknight's tour

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Generalized knight's tours on rectangular chessboards
• scientific article; zbMATH DE number 888852
• Bounds on the number of knight's tours
• Knight's Tours on a Torus
• Variations on the knight's tour for rectangular chessboards on alternative surfaces

Cited in

(19)

• Knight's moves, graphs, and lattices
• Solution of the knight's Hamiltonian path problem on chessboards
• Generating Hamiltonian circuits without backtracking from errors
• Bounds on the number of knight's tours
• The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
• Tours of a generalized knight on rectangular chessboards
• scientific article; zbMATH DE number 3847430 (Why is no real title available?)
• scientific article; zbMATH DE number 38310 (Why is no real title available?)
• Which Rectangular Chessboards Have a Knight's Tour?
• Connectivity of Knight's Graphs
• scientific article; zbMATH DE number 637357 (Why is no real title available?)
• The Knight's Tour on the 15-Puzzle
• scientific article; zbMATH DE number 1011083 (Why is no real title available?)
• Unique Rook Circuits
• scientific article; zbMATH DE number 888852 (Why is no real title available?)
• scientific article; zbMATH DE number 1439456 (Why is no real title available?)
• scientific article; zbMATH DE number 2226730 (Why is no real title available?)
• Leaper Tours
• Taming the knight's tour: minimizing turns and crossings

This page was built for publication:

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