(1)
Löbbing, M.; Wegener, I. The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting With Binary Decision Diagrams. Electron. J. Combin. 1996, 3, R5.