Divide the grid into non-branching non-looping regions (snakes) of at least two groups of colors. No 2x2 area is contained within one region, and borders must separate different regions. Four different regions cannot meet at the same corner.
If a number clue appears within a region, it denotes the product of the sizes of each color group within that region. Separate instances of the same color within a region count as new groups. Only one clue can exist in a region.
Solve on Sudokupad (No solution check)
Lösungscode: Quantity of vertical region borders in the first 5 rows
am 26. Februar 2025, 17:34 Uhr von the_cogito
Tricky, but nice! I had fun with this.