The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams. Loebbing, Martin; Wegener, Ingo — 1996 The Electronic Journal of Combinatorics [electronic only]