Find a looped path through the grid subject to the following constraints: the path must proceed from one cell to an adjacent cell, it must pass through no cell more than once, it must not go through any numbered cells, and must never make a sharp 60^o turn. Each number indicates how many of the adjacent cells are part of the path.