Jump to content

Warnsdorff's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Elkman (talk | contribs) at 15:00, 17 July 2007 (+cat, stub sort). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Warnsdorff's algorithm is a heuristic method for solving the Knight's Tour. The algorithm was first described in "Des Rösselsprungs einfachste und allgemeinste Lösung" by H. C. Warnsdorff in 1823.