Talk:Knight's tour: Difference between revisions

Talk:Knight's tour (view source)

418 bytes added , 4 years ago

m

no edit summary

Anonymous user

Revision as of 06:28, 21 July 2015 (view source) rosettacode>Paddy3118 (→‎Tiling smaller tours) ← Older edit		Latest revision as of 13:38, 29 August 2019 (view source) rosettacode>Ocostea mNo edit summary
(3 intermediate revisions by 2 users not shown)
Line 1: == solutions found fast == Wow, this was found fast. I was still prepping my first couple implementations.:) --[[User:Markjreed\|Markjreed]] 02:09, 30 May 2011 (UTC) Line 9 ⟶ 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) :::::::   (above) referenced document can be found here: [http://math.oregonstate.edu/~math_reu/proceedings/REU_Proceedings/Proceedings2004/2004Ganzfried.pdf A Simple Algorithm for Knight’s Tours by Sam Ganzfried]