0
This is a Haisu puzzle. Draw a path from S to G passing through all cells exactly once by connecting the centres of adjacent cells, such that when the path passes over a number N, it is on its Nth entry to the region which contains it.
Enjoy! There is a logical path through the puzzle, so in t...