Anonymous user
Talk:Solve a Hidato puzzle: Difference between revisions
→Rules: new section
m (how to improve) |
(→Rules: new section) |
||
Line 11:
:: well, for starters the example problem on wikipedia could be used as the input to be solved. a solution is there too, and a better description for what the rules are can be made. maybe even a better drawing for the solution that includes a thread that connects all the numbers in sequence. alternatively though maybe a square 3x3 problem is easier, so that just needs to be found. are any other details missing to make the task solvable?--[[User:EMBee|eMBee]] 02:21, 13 January 2012 (UTC)
::: Certainly a set example and result are needed. A better description. The wp diagram or one like it should be fine if accompanied by a better description. I guess one of my concerns is making sure we have a properly set puzzle with a unique solution. For a small example, this can be validated via brute force. That raises the question if there is any requirement to find a solution by means other than brute force? And of course copyright if we have to use another source. I'd also remove the extra credit as a task; although, noting this as an application with some kind of reference would be interesting background. I'll leave the task of setting a puzzle and observe that we don't have such a task for [[Sudoku]] yet. That just about covers it for me. --[[User:Dgamey|Dgamey]] 04:28, 13 January 2012 (UTC)
== Rules ==
The rules are:
* You are given a grid with some numbers placed in it. The other squares in the grid will be blank.
** The grid is not necessarily rectangular.
** The grid may have holes in it.
** The grid is always connected.
** The number “1” is always present, as is another number that is equal to the number of squares in the grid. Other numbers are present so as to force the solution to be unique.
* The aim is to place a natural number in each blank square so that in the sequence of numbered squares from “1” upwards, each square is in the [[wp:Moore neighborhood]] of the squares immediately before and after it in the sequence (except for the first and last squares, of course, which only have one-sided constraints).
** Thus, if the grid was overlaid on a chessboard, a king would be able to make legal moves along the path from first to last square in numerical order.
* In a proper Hidato puzzle, the solution is unique. (Only really relevant during construction, but might make solving easier.)
I think that sums them up properly. –[[User:Dkf|Donal Fellows]] 10:41, 13 January 2012 (UTC)
| |||