The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams

@article{Lbbing1995TheNO,
  title={The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams},
  author={Martin L{\"o}bbing and Ingo Wegener},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={1995},
  volume={2}
}