Talk:Solve a Hidato puzzle: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 2:
I'm really reluctant to admit this as a full task just yet, as it is dependent on a complex applet in an external website. Better would be to put a description (which could involve a link to wikipedia) and specific problem to solve in this page. We can always judge for ourselves whether someone's solved the actual problem or just the specific instance of it. –[[User:Dkf|Donal Fellows]] 13:31, 12 January 2012 (UTC)
Technically I think the complex applet is a complex servlet.
take one to the same place. In spite of what's said below I've just enjoyed a few mins research there.
–[[User:Dkf|Nigel Galloway]]
Line 41:
::* 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)
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.
| |||