Talk:Knight's tour: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 1: | Line 1: | ||
Wow, this was found fast. I was still prepping my first couple implementations.:) |
Wow, this was found fast. I was still prepping my first couple implementations.:) |
||
[[User:Markjreed|Markjreed]] 02:09, 30 May 2011 (UTC) |
[[User:Markjreed|Markjreed]] 02:09, 30 May 2011 (UTC) |
||
Added my original perl solution and sample output; moved out of draft status. |
|||
[[User:Markjreed|Markjreed]] 02:48, 30 May 2011 (UTC) |
|||
== References == |
== References == |
||
Revision as of 02:48, 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)