Revision as of 12:22, 4 June 2014 (view source) Nigel Galloway (talk \| contribs) m (→‎{{header\|Ruby}}) ← Older edit		Revision as of 12:28, 4 June 2014 (view source) Nigel Galloway (talk \| contribs) No edit summary Newer edit →
Line 1: {{~~draft~~ task}} Hopido puzzles are similar to [[Solve a Hidato puzzle \| Hidato]]. The most important difference is that the only moves allowed are: hop over one tile diagonally; and over two tiles horizontally and vertically. It should be possible to start anywhere in the path, the end point isn't indicated and there are no intermediate clues. [http://gamesandinnovation.com/2010/02/10/hopido-design-post-mortem/ Hopido Design Post Mortem] contains the following: Line 14: . . 0 0 0 . . . . . 0 . . . The task is to write a program which will prove that it is possible to reach every node in the above example moving as described above starting at every point in the example. If you can find a path whose end point is a leagal move from the start point you may conclude that it is possible to complete it from every point without exhausting every possible start point. Extra credits are available for other interesting designs. Realated Tasks: ;[[Solve a Hidato puzzle]] ;[[Solve a Holy Knight's tour]] ;[[Solve a Numbrix puzzle]] ;[[Knight's tour]] =={{header\|Perl 6}}==

Solve a Hopido puzzle: Difference between revisions

Solve a Hopido puzzle (view source)