Löbbing, M. and Wegener, I. 1996. The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams. The Electronic Journal of Combinatorics. 3, 1 (Jan. 1996), R5. DOI:https://doi.org/10.37236/1229.