Anonymous user
Talk:Solve a Hidato puzzle: Difference between revisions
→On the application of Warnsdorff to Hidato
(→Any good general algorithm?: Hidato ≡ Hamiltonian Path = NP complete) |
|||
Line 136:
Finally can we also do the Knight's Tour?
: Warnsdorf is truth for Knight's Tour, but it's not truth for Hidato, hence they are not the same problem (your logic). Warnsdorff this:
1 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 0 0 -1 -1 -1 82
-1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1
-1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1 0 -1 0 -1 -1
0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 -1 -1 -1
:--[[User:Ledrug|Ledrug]] 17:29, 6 May 2012 (UTC)
|