#431 - Haisu / Balance Loop Hybrid
Draw a non-intersecting path through the centers of all cells, starting from the S (start) and finishing at the G (goal). Each numerically clued cell must be traveled through on the path’s Nth visit to the region the clue lies within, where N is the value of the clue. The straight line segments coming out of a white circle must have equal length, while the straight line segments coming out of a black circle must have different lengths.
Comments
Post a Comment