The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.
Loebbing, Martin ; Wegener, Ingo
The Electronic Journal of Combinatorics [electronic only], Tome 3 (1996), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PS)
Publié le : 1996-01-01
EUDML-ID : urn:eudml:doc:222921 
@article{00861593,
     title = {The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {3},
     year = {1996},
     zbl = {0851.05003},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00861593}
}

Loebbing, Martin; Wegener, Ingo. The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.. The Electronic Journal of Combinatorics [electronic only], Tome 3 (1996) . http://gdmltest.u-ga.fr/item/00861593/