LÖBBING, M.; WEGENER, I. The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams. The Electronic Journal of Combinatorics, v. 3, n. 1, p. R5, 19 Jan. 1996.