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. [Internet]. 1996Jan.19 [cited 2026Mar.27];3(1):R5. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v3i1r5