Skip to main content Skip to main navigation menu Skip to site footer
Page Header Logo
  • Home
  • All Issues
  • Dynamic Surveys
  • Submissions
  • About
    • About the Journal
    • Contact
    • Editorial Team
Search
  • Register
  • Login
  1. Home /
  2. Archives /
  3. Volume 3, Issue 1 (1996) /
  4. Research Papers

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

  • Martin Löbbing
  • Ingo Wegener
DOI: https://doi.org/10.37236/1229

Abstract

The number of knight's tours, i.e. Hamiltonian circuits, on an $8 \times 8$ chessboard is computed with decision diagrams which turn out to be a useful tool for counting problems.

  • PDF
  • COMMENT
  • Supplementary File
Published
1996-01-19
Issue
Volume 3, Issue 1 (1996)
Article Number
R5