The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.

Loebbing, Martin, and 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] 3.1 (1996): . <http://eudml.org/doc/222921>.

@article{Loebbing1996,
author = {Loebbing, Martin, Wegener, Ingo},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {knight's tours; Hamiltonian circuits; decision diagrams; counting problems},
language = {eng},
number = {1},
pages = {},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The number of knight's tours equals 33, 439, 123, 484, 294—counting with binary decision diagrams.},
url = {http://eudml.org/doc/222921},
volume = {3},
year = {1996},
}

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
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 3
IS - 1
SP -
LA - eng
KW - knight's tours; Hamiltonian circuits; decision diagrams; counting problems
UR - http://eudml.org/doc/222921
ER -