Talk:Solve a Hidato puzzle: Difference between revisions

Talk:Solve a Hidato puzzle (view source)

295 bytes added , 9 years ago

m

Anonymous user

Revision as of 16:56, 21 March 2014 (view source) rosettacode>Ak (→‎extra credit suggestion) ← Older edit		Latest revision as of 23:00, 4 July 2014 (view source) rosettacode>Amitkuba m (→‎solved it using constraint programming)
(11 intermediate revisions by 2 users not shown)
Line 226: --[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 14:12, 30 December 2013 (UTC) : if a1 = 0, the equation b2 + c2 + d2 = a1 means "Non of a's neighbors is 2" which is not necessarily true. so this solution does not work. --[[User:Ak\|Ak]] ([[User talk:Ak\|talk]]) 17:10, 21 March 2014 (UTC) ==extra credit suggestion== Line 238 ⟶ 240: ::: As regarding the Knights Tour: in fact, I used the same code in the REXX example, I just tweaked/optimized the code a bit for speed. -- [[User:Gerard Schildberger\|Gerard Schildberger]] ([[User talk:Gerard Schildberger\|talk]]) 16:20, 30 December 2013 (UTC) ~~sss~~ == solved it using constraint programming == Behold: http://hidoku-solver.appspot.com/