19 hexagons are arranged in a grid.
Each hexagon has a number of curved paths starting at one side and ending at another side,
possibly lining up with a path inside a neighboring hexagon.
The paths come in three different colors.
By clicking on a hexagon, it rotates 60 degrees.
- There exists a single loop of line segments that passes through every tile of the grid.
- No other loop exists.
- Any set of three consecutive line segments on the loop contain each of the three colors.
- The ends of any line segment not on the loop must either line up with a line segment of the same color or line up with the boundary of the grid.
The following is an example of a correct solution:
An example of a solution
Clarifications:
- A line segment is defined as a line that is fully contained within one hexagon, with its ends on two different sides of the hexagon.
-
Rule #3 can be restated as: If a line segment is on the loop, its neighbors must
- be of a different color than the color of that line segment, and
- be of a different color from one another.
-
Rule #4 can be elaborated as: An end of a line segment not on the loop must either
- touch the boundary of the entire grid of hexagons, or
- line up with a neighboring line segment of the same color.
- line up with a neighboring line segment of a different color, nor
- line up with an empty side of a neighboring hexagon.
- The loop may pass through a tile multiple times. It may cross itself doing so.
- The black dots and dashes are only for visual aid in telling the colors apart.
- I forgot to include a solution, but this has kindly been provided here! (Spoiler warning)
