Anonymous user
Talk:Solve a Hidato puzzle: Difference between revisions
→Any good general algorithm?: new section
(→Any good general algorithm?: new section) |
|||
Line 68:
: I do have a version that solves even those awkward cases (using a more careful speculative execution model but still based on the solution in the task) but it's rather longer. I'll put it on a sub-page. –[[User:Dkf|Donal Fellows]] 08:24, 2 May 2012 (UTC)
:: Extended version failed on the "awkward" example with a stock Tcl8.6. Guess it's not recent enough? --[[User:Ledrug|Ledrug]] 00:07, 3 May 2012 (UTC)
== Any good general algorithm? ==
I added a larger example in the C code, which is meant to make brute force search miserable. The C code can solve it, but it takes quite long; I expect D to behave similarly. The Perl/Python/Tcl code should be able to solve it, if only taking forever, since they all use the same exhaustive search method (Tcl is forced into such a situation, but anyway). The Mathprog code gives up on it on my machine, rather quickly, which can be said to be the bright side.
Note that that example is trivial for a human. Does anyone have any clever way to deal with such cases? --[[User:Ledrug|Ledrug]] 00:59, 3 May 2012 (UTC)
| |||