%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