I have returned. — Douglas MacArthur
Thanks to KNT for testing.
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.
Digits in a circle indicate the size of the polyomino it is in, and digits in a square indicate the number of polyominoes in its region.
A digit in a clued cell indicates the number of cells seen in the indicated directions combined (including itself). POLYOMINO borders obstruct vision.
Penpa solvers only: Answer check requires all digits to be filled out and green edges for both region and polyomino borders.
Lösungscode: Column 1, but include an X for every fillomino barrier. (Region barriers are included.)
am 4. Juli 2023, 04:02 Uhr von Christounet
Gorgeous follow-up of the first puzzle. I found that one a bit easier than #1, maybe because I got acquainted with the rules. But I kept forgetting basic fillomino logic in the midsolve. I wouldn't mind solving a #3 with a new twist ! ;)
am 2. Juli 2023, 12:42 Uhr von Silverstep
About as difficult as the first one, but feels a lot nicer. Solving was smooth all the way from beginning to end.
am 13. Juni 2023, 11:24 Uhr von bodemeister
Fun and hard! Thanks for the puzzle.
am 12. Juni 2023, 16:52 Uhr von henrypijames
This is much harder than the first one.
am 11. Juni 2023, 00:50 Uhr von sonicbyte
Very pleasurable, well done.
am 8. Juni 2023, 09:08 Uhr von marcmees
very nice. thanks.
am 8. Juni 2023, 06:50 Uhr von twobear
Great puzzle, thank you!
am 8. Juni 2023, 00:07 Uhr von Jesper
Great puzzle, thanks!
am 7. Juni 2023, 21:56 Uhr von Myxo
Really cool puzzle!
am 7. Juni 2023, 18:16 Uhr von KNT
Enjoyed testing this. Really sustained solve with a surprising variety of logic, it doesn't let up even at the very end