\magnification=1440
\font\bigtenrm=cmr10 scaled\magstep4
Abstract for Martin L\"obbing and Ingo Wegener,
The Number of Knight's 
Tours Equals 33,439,123,484,294 --- Counting with Binary Decision Diagrams

The number of knight's tours, i.e. Hamiltonian circuits, on
an $8 \times 8$ chessboard is computed with decision
diagrams which turn out to be a useful tool for counting problems.


\bye