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) no. 1.

Voir la notice de l'article dans European Digital Mathematics Library

Classification : 05A15, 05C45, 05B99
Mots-clés : knight's tours, Hamiltonian circuits, decision diagrams, counting problems 
@article{EJC_1996__3_1_222921,
     author = {Loebbing, Martin and Wegener, Ingo},
     title = {The number of knight's tours equals 33, 439, 123, 484, 294{\textemdash}counting with binary decision diagrams.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     publisher = {mathdoc},
     volume = {3},
     number = {1},
     year = {1996},
     zbl = {0851.05003},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/EJC_1996__3_1_222921/}
}
TY  - JOUR
AU  - Loebbing, Martin
AU  - Wegener, Ingo
TI  - The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.
JO  - The Electronic Journal of Combinatorics [electronic only]
PY  - 1996
VL  - 3
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/EJC_1996__3_1_222921/
LA  - en
ID  - EJC_1996__3_1_222921
ER  - 
%0 Journal Article
%A Loebbing, Martin
%A Wegener, Ingo
%T The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.
%J The Electronic Journal of Combinatorics [electronic only]
%D 1996
%V 3
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/EJC_1996__3_1_222921/
%G en
%F EJC_1996__3_1_222921
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) no. 1. https://geodesic-test.mathdoc.fr/item/EJC_1996__3_1_222921/