Logic Masters Deutschland e.V.

Sandwich Fillomino #2

(Eingestellt am 19. November 2021, 10:00 Uhr von Mark Sweep)

I have created a Sandwich Fillomino before, which turned out to be a very challenging puzzle. I have tried to create more approachable puzzles with this constraint, as I do think the logic of this variant can be interesting.

Rules
Divide the grid in regions, such that no two regions of the same size touch orthogonally. Each cell contains a number that indicates the size of the polyomino it is in. Clues outside the grid indicate the sum of numbers between the unique segments of highest numbers and lowest numbers in the row or column.

Example
A dash (-) means there is no valid sandwich clue in that row/column. Note how in row 5, there is no valid clue, because even though the highest numbers in the row (the 8s) are from the same region, it is unclear which one would have to be chosen for the sandwich because they are separated. This is not a problem in for instance column 1, where all 8s in the column are connected within the column and thus form a single, unique segment of largest digits.




The puzzle

Solve on Penpa

Lösungscode: Column 2, column 9

Zuletzt geändert am 15. Dezember 2021, 15:27 Uhr

Gelöst von MagnusJosefsson, Jesper, marcmees, r45, Dandelo, wawawawa, Mjb99, Statistica, ChristJan, CJK, moeve, Uhu, Aspartagcus, jessica6, moss, misko, polar, GTLSE
Komplette Liste

Kommentare

am 16. Dezember 2021, 08:56 Uhr von Aspartagcus
Brilliant, as always! Thanks! :)

am 19. November 2021, 21:36 Uhr von marcmees
nevertheless with some tricky, well hidden corners. Enjoyed that a lot. thanks.

am 19. November 2021, 18:30 Uhr von Jesper
Very nice! I agree that this puzzle is much more approachable than #1, and very pleasant to solve.

am 19. November 2021, 10:50 Uhr von MagnusJosefsson
Wonderful puzzle! Very pleasing logic and not too difficult. Very consistent level throughout as well. Thanks Mark!

Schwierigkeit:3
Bewertung:100 %
Gelöst:18 mal
Beobachtet:3 mal
ID:0008AR

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden