The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams (Q1909973)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams |
scientific article |
Statements
The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams (English)
0 references
21 July 1996
0 references
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.
0 references
knight's tours
0 references
Hamiltonian circuits
0 references
decision diagrams
0 references
counting problems
0 references
