Although the puzzle is on a smaller, if not much smaller, than usual hex grids, I hope that the theme does not lose itself in the solve. Nothing remarkable is happening in this puzzle except for the theme, which is really why I am publishing this puzzle. On hex grids, Slitherlink works in a tad different way, in that, each cell has 2 more surrounding edges, and consequently a few more neighbors than in square grids. Secondly, as there are only 3 grid edges meeting at a point, there is really no possibility of two different subsections of the loop "meeting at a point" - usually a very useful meta logic in square grids to see that the move is wrong.
Rules: Draw a single closed loop by connecting neighboring grid points along the grid lines. Each numbered cell or irregular group of cells indicates how many of its bounding edges are used by the loop.
About HexSlithehrlink: Slitherlink was invented by Nikoli puzzles. Several of its variations have been explored since, some of them being Hex, Sheep and wolves, False clue, Polygraph, Irregular and more.
No comments:
Post a Comment