ACM

Communications of the ACM

Home/Magazine Archive/July 1967 (Vol. 10, No. 7)/A method for finding Hamilton paths and Knight's tours/Abstract

A method for finding Hamilton paths and Knight's tours

By Ira Pohl
Communications of the ACM, July 1967, Vol. 10 No. 7, Pages 446-449
10.1145/363427.363463
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.