Jump to content

Warnsdorff's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Raul654 (talk | contribs) at 14:38, 17 July 2007 (new article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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