%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