The Number of Knight's Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision Diagrams.

Martin Löbbing Ingo Wegener The Number of Knight's Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision Diagrams. 1996 3 Electr. J. Comb. 1 http://www.combinatorics.org/Volume_3/Abstracts/v3i1r5.html db/journals/combinatorics/combinatorics3.html#LobbingW96