Generating Hamiltonian circuits without backtracking from errors

DOI10.1016/0304-3975(94)90239-9zbMATH Open0821.90133OpenAlexW2059207171MaRDI QIDQ1334673FDOQ1334673

Authors: Jefferey A. Shufelt, Hans J. Berliner 

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

Recommendations

• A method for finding Hamilton paths and Knight's tours
• Solution of the knight's Hamiltonian path problem on chessboards
• Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards
• scientific article; zbMATH DE number 3853116
• The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams

zbMATH Keywords

knightChessHamiltonian circuit graph search problemsmultiple closed tours

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Counting Hamiltonian cycles in bipartite graphs
• Title not available (Why is that?)

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

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