[rookie1ja]

Hexagons - Back to the New Puzzles
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 60^o angle). Each number indicates how many of the adjacent hexagons are part of the path.

 hexagon.gif (3.43K)
Number of downloads: 2450

Spoiler for Solution:

Hexagons - solution
 hexagon-solution.gif (3.97K)
Number of downloads: 2459

Spoiler for old wording:

Find a looped path through the diagram subject to the following constraints. The path proceeds from one square to an adjacent square (Edit: the path passes through the center of each hexagon), passes through no square more than once, does not go through any numbered squares, and never makes a sharp-angled turn (i.e., a turn at a 60o angle). Each number indicates how many of the adjacent squares are part of the path.

 hexagon.gif (3.43K)
Number of downloads: 2450

[mwh]

The task would have been clearer to me if you had said the path "passes through the CENTER of each HEXAGON".