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

Martin Löbbing, Ingo Wegener. The Number of Knight s Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams. Electronic Colloquium on Computational Complexity (ECCC), 2(47), 1995. [doi]

Abstract

Abstract is missing.