Anonymous user
Talk:Solve a Hidato puzzle: Difference between revisions
→Any good general algorithm?: c'est la vie
(→Any good general algorithm?: Suspect you need several algorithms…) |
(→Any good general algorithm?: c'est la vie) |
||
Line 81:
I suspect that the reason people can solve that problem easily is that they switch strategies easily. Coming up with a way to characterize how to switch is the hard part. (The Tcl code is much more optimized for the case where it's dealing with path sections that are fairly short and which mostly stretch between end points; this is a useful strategy with the majority of Hidato puzzles published in the press, but is far less useful with these evil edge cases.) –[[User:Dkf|Donal Fellows]] 08:07, 3 May 2012 (UTC)
: Heeey, who you callin' evil?
: I was curious if anyone has a good heuristic method that's reasonably simple and works for most cases, like the one used in knight's tour, but I guess it's a bit asking for much. It's just that a task with only an exponential brute force general solution is somewhat disappointing -- oh well. --[[User:Ledrug|Ledrug]] 11:35, 3 May 2012 (UTC)
== Short C version ==
| |||