Jump to content

Warnsdorff's algorithm

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Leon math (talk | contribs) at 00:35, 28 January 2009 (justed merged Warnsdorff's algorithm into Knight's tour, will now do clean up at knight's tour). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Redirect to:

  • From a merge: This is a redirect from a page that was merged into another page. This redirect was kept in order to preserve the edit history of this page after its content was merged into the content of the target page. Please do not remove the tag that generates this text (unless the need to recreate content on this page has been demonstrated) or delete this page.