Löbbing, M., and I. Wegener. “The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting With Binary Decision Diagrams”. The Electronic Journal of Combinatorics, Vol. 3, no. 1, Jan. 1996, p. R5, doi:10.37236/1229.