Another Nikoli experiment. Draw a loop joining orthogonally adjacent cell centres. All points where straight loop segments intersect are given as crosses, and must be visited. The loop may not touch itself (stop sniggering) at any other point or way. The loop must visit all cells with triangles, and must turn at those points. Some of these triangles may be marked with a number, which indicates the total number of cells visited by the straight loop segments meeting there.
I have never actually seen one of these problems before in any medium, so I have no idea how close these are to the typical problem of this sort. The first one is an easy introduction to the rules, the second one is just a bit meatier.
0 comments:
Post a Comment