Thanks to mellowrobinson for testsolving!
Divide the grid into 9 orthogonally connected regions of size 9, and place the digits 1-9 in the grid such that each row, column, and region has one copy of each digit.
Then, divide each region into some polyominoes such that no two polyominoes of the same size share an edge or have the same sum, and no polyomino has sum 24.
An arrow indicates the cell is part of a polyomino of size n, and the nearest polyomino of size n in the indicated direction is exactly n cells away, where n is the digit in the arrow.
A cage indicates the cell is part of a polyomino with sum S and is part of a region containing n polyominoes, where n is the digit placed in the cage and S is the sum denoted in the top-left corner.
Lösungscode: Row 5
am 28. Mai 2026, 22:19 Uhr von mellowrobinson
Excellent puzzle, intricate logic with a big payoff, and surprising how few clues are needed!
> Thank you so much for (test)solving, and I'm glad you enjoyed the puzzle!
| Schwierigkeit: | ![]() |
| Bewertung: | N/A |
| Gelöst: | 4 mal |
| Beobachtet: | 0 mal |
| ID: | 000T1C |