The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams

zbMath0851.05003MaRDI QIDQ1909973

Ingo Wegener, Martin Loebbing

Publication date: 21 July 1996

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222921

zbMATH Keywords

Hamiltonian circuitscounting problemsdecision diagramsknight's tours

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Eulerian and Hamiltonian graphs (05C45) Designs and configurations (05B99)

Related Items

Book review of: J. Sesiano, Euler et le parcours du cavalier. Avec une annexe sur le théorème des polyèdres ⋮ Optimal ordered binary decision diagrams for read-once formulas ⋮ Counting Hamiltonian cycles in bipartite graphs