Anonymous user
Talk:Solve a Hidato puzzle: Difference between revisions
m
extra credits and difficulty
m (→Needed improvements: on research) |
m (extra credits and difficulty) |
||
Line 42:
::* We still need the samples, the ones from Wikipedia should work.
::* I still don't know anything about the hardness of this and if brute force or elegance is preferred/needed. It seems to me that given the Moore Neighbourhood constraint that puzzles would have to get really quite large before brute force would have any problems (but that's just gut feel). --[[User:Dgamey|Dgamey]] 17:58, 13 January 2012 (UTC)
::: Thinking about it, finding a unique solution to Knights Tour given similar clues and a unique solution is likely much easier than solving Knights Tours. An alternate name for this might seem to be a Kings Tour (sadly, not very exciting).
See http://en.wikipedia.org/wiki/Adjacency_list fo a discussion of implementations. The Mathprog example Rule 3 is such a list. As is Rule 3 in the Mathprog Knights Tour example. Only the definition of adjacency has changed. We could add extra credit if it also solves Numbrix which is a von Neuman Neighbourhood.
–[[User:Dkf|Nigel Galloway]]
: Perhaps worthy of its own task. There are probably lots of interesting research and discussion for Numbrix. --[[User:Dgamey|Dgamey]] 21:05, 13 January 2012 (UTC)
| |||