A method for finding Hamilton paths and Knight's tours

  • Authors:

  • Ira Pohl

  • Affiliations:

  • Stanford Univ., Stanford, CA

  • Venue:
  • Communications of the ACM
  • Year:
  • 1967

Quantified Score

Hi-index 48.22

Visualization

Abstract

The use of Warnsdorff's rule for finding a knight's tour is generalized and applied to the problem of finding a Hamilton path in a graph. A graph-theoretic justification for the method is given.