Löbbing, Martin, and Ingo Wegener. “The Number of Knight’s Tours Equals 33,439,123,484,294 — Counting With Binary Decision Diagrams”. The Electronic Journal of Combinatorics 3, no. 1 (January 19, 1996): R5. Accessed March 27, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v3i1r5.