zbMATH — the first resource for mathematics

The number of knight’s tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams. (English) Zbl 0851.05003
Summary: The number of knight’s tours, i.e. Hamiltonian circuits, on an 8 by 8 chessboard is computed with decision diagrams which turn out to be a useful tool for counting problems.

05A15 Exact enumeration problems, generating functions
05B99 Designs and configurations
05C45 Eulerian and Hamiltonian graphs
Full Text: EMIS EuDML