M. Löbbing and I. Wegener, “The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams”, Electron. J. Combin., vol. 3, no. 1, p. R5, Jan. 1996.