Find a looped path through the diagram subject to the following constraints. The path proceeds from one hexagon to an adjacent hexagon through the center of each hexagon, passes through no hexagon more than once, does not go through any numbered hexagon, and never makes a acute angle turn (i.e., a turn at a 60o angle). Each number indicates how many of the adjacent hexagons are part of the path.
This old topic is locked since it was answered many times. You can check solution in the Spoiler below.
Pls visit New Puzzles section to see always fresh brain teasers.