Jump to content

Talk:Knight's tour: Difference between revisions

m
→‎References: added a note that a link was broken (for a simple algorithm for knight's tours.
(added a section header (to the first text) so that the TOC would appear in the correct location.)
m (→‎References: added a note that a link was broken (for a simple algorithm for knight's tours.)
Line 10:
 
The following had more than I needed to know about the problem [http://www.cs.cmu.edu/~sganzfri/REUPaper.pdf A Simple Algorithm for Knight’s Tours] by Sam Ganzfried. --[[User:Paddy3118|Paddy3118]] 07:22, 29 May 2011 (UTC)
:::::::   (above) broken link.     -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:56, 22 July 2019 (UTC)
 
 
Cookies help us deliver our services. By using our services, you agree to our use of cookies.