Generating Hamiltonian circuits without backtracking from errors

DOI10.1016/0304-3975(94)90239-9zbMath0821.90133OpenAlexW2059207171MaRDI QIDQ1334673

Hans J. Berliner, Jefferey A. Shufelt

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90239-9

zbMATH Keywords

knightChessHamiltonian circuit graph search problemsmultiple closed tours

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43)

Related Items (1)

Counting Hamiltonian cycles in bipartite graphs

Cites Work

• Unnamed Item
• An almost perfect heuristic for the N nonattacking queens problem
• A dynamic programming solution to the \(n\)-queens problem
• Neural network computing for knight's tour problems
• Solution of the knight's Hamiltonian path problem on chessboards
• Which Rectangular Chessboards Have a Knight's Tour?
• Estimating the Efficiency of Backtrack Programs

This page was built for publication: Generating Hamiltonian circuits without backtracking from errors