Talk:Knight's tour: Difference between revisions
Content added Content deleted
(→References: +sig) |
|||
| Line 13: | Line 13: | ||
I discovered this weekend that Warnsdorff sometimes generates incomplete tours. This is discussed in Granzfried (above) and also in Mordecki. |
I discovered this weekend that Warnsdorff sometimes generates incomplete tours. This is discussed in Granzfried (above) and also in Mordecki. |
||
* [http://www.cmat.edu.uy/~mordecki/articles/warnsdorff.pdf Counting Knight's Tours through the Randomized Warnsdor� Rule, Cancela & Mordecki, 2006] --[[User:Dgamey|Dgamey]] 11:05, 30 May 2011 (UTC) |
* [http://www.cmat.edu.uy/~mordecki/articles/warnsdorff.pdf Counting Knight's Tours through the Randomized Warnsdor� Rule, Cancela & Mordecki, 2006] --[[User:Dgamey|Dgamey]] 11:05, 30 May 2011 (UTC) |
||
* [ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/74/442/CS-TR-74-442.pdf Estimating the efficiency of backtrack programs, knuth, 1974] --[[User:Dgamey|Dgamey]] 11:36, 30 May 2011 (UTC) |
|||
Revision as of 11:36, 30 May 2011
Wow, this was found fast. I was still prepping my first couple implementations.:) Markjreed 02:09, 30 May 2011 (UTC)
Added my original perl solution and sample output; moved out of draft status. Markjreed 02:48, 30 May 2011 (UTC)
References
The following had more than I needed to know about the problem A Simple Algorithm for Knight’s Tours by Sam Ganzfried. --Paddy3118 07:22, 29 May 2011 (UTC)
I discovered this weekend that Warnsdorff sometimes generates incomplete tours. This is discussed in Granzfried (above) and also in Mordecki.
- [http://www.cmat.edu.uy/~mordecki/articles/warnsdorff.pdf Counting Knight's Tours through the Randomized Warnsdor� Rule, Cancela & Mordecki, 2006] --Dgamey 11:05, 30 May 2011 (UTC)
- Estimating the efficiency of backtrack programs, knuth, 1974 --Dgamey 11:36, 30 May 2011 (UTC)