scientific article; zbMATH DE number 599567

MaRDI QIDQ4297764zbMATH OpenFDO

Authors Marco Valtorta, I. Ishaq Zahid

Publication date 3 May 1995

zbMATH Keywords

knight's tour problemtie-breaking ruleWarnsdorff's algorithmWarnsdorff's tour

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 637357
• scientific article; zbMATH DE number 888852
• A method for finding Hamilton paths and Knight's tours
• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• Solution of the knight's Hamiltonian path problem on chessboards

Cited in

(7)

• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• Taming the knight's tour: minimizing turns and crossings
• Algorithms for finding knight's tours on Aztec diamonds
• Maharaja Nim: Wythoff's queen meets the knight
• scientific article; zbMATH DE number 637357 (Why is no real title available?)
• 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:

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