An improved method for finding knight covers.

MaRDI QIDQ5310259zbMATH OpenFDO

Authors F. Rubin

Publication date 21 September 2007

zbMATH Keywords

knight covers

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2197897
• scientific article; zbMATH DE number 2197890
• The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
• scientific article; zbMATH DE number 4063108
• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards

Cited in

(5)

• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• A method for calculating the Knight's total tour count
• scientific article; zbMATH DE number 809140 (Why is no real title available?)
• scientific article; zbMATH DE number 2197890 (Why is no real title available?)
• scientific article; zbMATH DE number 2197897 (Why is no real title available?)

This page was built for publication: An improved method for finding knight covers.

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