Geodesic
The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The number of knight's tours, i.e. Hamiltonian circuits, on an $8 \times 8$ chessboard is computed with decision diagrams which turn out to be a useful tool for counting problems.

Supplementary Materials:
Supplementary material for this article is supplied as a separate file:

DOI : 10.37236/1229
Classification : 05A15, 05B99, 05C45
Mots-clés : knight's tours, Hamiltonian circuits, decision diagrams, counting problems 
@article{10_37236_1229,
     author = {Martin L\"obbing and Ingo Wegener},
     title = {The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1229},
     zbl = {0851.05003},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1229/}
}
TY  - JOUR
AU  - Martin Löbbing
AU  - Ingo Wegener
TI  - The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1229/
DO  - 10.37236/1229
ID  - 10_37236_1229
ER  - 
%0 Journal Article
%A Martin Löbbing
%A Ingo Wegener
%T The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1229/
%R 10.37236/1229
%F 10_37236_1229
Martin Löbbing; Ingo Wegener. The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1229

Cité par Sources :