Anonymous user
Talk:Knight's tour: Difference between revisions
→References: more refs-
(→References: more refs-) |
|||
Line 15:
* [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)
* [http://faculty.olin.edu/~sadams/DM/ktpaper.pdf Knight's Tours, Hill & Tostado, 2004] --[[User:Dgamey|Dgamey]] 19:56, 30 May 2011 (UTC)
I found some additional references that may be of interest including a genetic algorithm, called Ant Colony.
* http://www.markkeen.com/knight/index.html
* http://www.cs.nott.ac.uk/~gxk/papers/phai04.pdf Ant Colony Algorithm
* http://arxiv.org/abs/arXiv:0803.4321
--[[User:Dgamey|Dgamey]] 10:10, 2 June 2011 (UTC)
== Incomplete Tours and Warnsdorff ==
| |||