The number of knight's tours equals 33,439,123,484,294 - Counting with binary decision diagrams

Electronic Journal of Combinatorics

Volumn 3, Issue 1 R, 1996, Pages 1-4

  Löbbing, Martin ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006035460     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (3)

1. Bryant, R. E. (1992). Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293-318.
2. Minato, S.-I. (1993). Zero-suppressed BDDs for set manipulation in combinatorial problems. Proc. of the 30th ACM/IEEE Design Automation Conference, 272-277.
3. Rouse Ball, W. W. and Coxeter, H. S. M. (1987). Mathematical recreations and essays. Dover, New York.