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.
Solution code: Column 1, but include an X for every fillomino barrier. (Region barriers are included.)
on 4. July 2023, 04:02 by 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 ! ;)
on 2. July 2023, 12:42 by Silverstep
About as difficult as the first one, but feels a lot nicer. Solving was smooth all the way from beginning to end.
on 13. June 2023, 11:24 by bodemeister
Fun and hard! Thanks for the puzzle.
on 12. June 2023, 16:52 by henrypijames
This is much harder than the first one.
on 11. June 2023, 00:50 by sonicbyte
Very pleasurable, well done.
on 8. June 2023, 09:08 by marcmees
very nice. thanks.
on 8. June 2023, 06:50 by twobear
Great puzzle, thank you!
on 8. June 2023, 00:07 by Jesper
Great puzzle, thanks!
on 7. June 2023, 21:56 by Myxo
Really cool puzzle!
on 7. June 2023, 18:16 by KNT
Enjoyed testing this. Really sustained solve with a surprising variety of logic, it doesn't let up even at the very end
Difficulty: | ![]() |
Rating: | 97 % |
Solved: | 42 times |
Observed: | 10 times |
ID: | 000E3T |