Fillo|filloMino|mino #2
(Eingestellt am 3. Juni 2026, 17:33 Uhr von Gqsp)
This is the second entry in my Overlapping Fillomino series. Expect to see harder puzzles with the same ruleset coming soon!
Introductory puzzle here : #1
Fillomino
Divide the grid into orthogonally connected regions. Enter the size of each region into all cells belonging to that region.
Regions of the same size may not share an edge.
Overlapped Fillomino
Each Fillomino overlaps exactly one other Fillomino.
For each overlapping pair, the overlapping area and every non-overlapping area are considered separate Fillomino regions and must satisfy all Fillomino rules.
A cell belongs to every Fillomino region containing it and therefore may contain multiple values.
Cells belonging to an overlap are shaded. All other cells are unshaded.
A clue number indicates the size of one Fillomino containing that cell. A '?' clue may represent any positive integer.
All Fillomino sizes represented within a cell are different.
The overlap between two Fillominos must be strictly smaller than each of the two overlapping Fillominos.
Yin-Yang
Shade cells so that all shaded cells form a single orthogonally connected area and all unshaded cells form a single orthogonally connected area.
No 2×2 block may be entirely shaded or entirely unshaded.
Overlapping Fillomino Example
Main Puzzle
Play on Penpa+Lösungscode: Row 2 (left to right) For each cell, enter the sizes of all Fillomino regions that contain that cell, in ascending order. For example, the first row of the first "valid" overlap in the overlapping fillomino example would give 14345345345
