EXAMPLE.
| 1.
| 2.
|
3.
| 4.
| 5.
|
6.
| 7.
| 8.
|
9.
| 10.
|
Each hexagonal grid below contains a loop of adjacent hexagons in which no sharp turns are ever made. The numbers in the grid indicate how many of the adjacent hexagons contain part of the path. The path does not go through any numbered hexagons. The first puzzle is solved as an example. Each puzzle below has a unique solution.
EXAMPLE.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.