Logic Masters Deutschland e.V.

Fillomino Whispers

(Eingestellt am 25. April 2025, 04:11 Uhr von Die Hard)

Introduction

Simple rules and 4 given digits - is that really sufficient?

Rules

Fillomino. Divide the grid into regions of between 1 and 9 cells and fill each region with the number of cells it contains (eg: fill all 7 cell regions with seven 7s, etc).

Anti Row/Column. Except for the given 1 in R3C1, the digit N cannot appear in row N or column N.

German Whispers. Orthogonally adjacent digits in different regions must differ by at least 5.

Please leave a comment if you enjoy this puzzle.

Lösungscode: All 9 digits in row 1.


Gelöst von tryote, Jesper, TheZwierz, jessica6, jkuo7, Snookerfan, SKORP17, Calvinball, Nylimb, misko, Blake Saligia, Fool on Hill, josebastian8, mse326, SSG, Ezawa, mew_rocks, annnz, SudokuHero, VeroBloom, ... willzz1122, Ppaatt, Oripy, OGRussHood, tome_coelho, Khatru, redfoot, kevinlimanta, jinkela114514, Chishiri, Uhu, Ktt, Morisenseiisgod, Shweebag, LabRat, lfm, reformist, luuu, karen_birgitta
Komplette Liste

Kommentare

am 7. November 2025, 01:08 Uhr von reformist
This is the first fillomino puzzle I've ever done, at least with the whisper and anti- constraints. So I rated the difficulty to match what everyone else chose. But it was very nice! I learned a lot of new tactics. Thanks.

am 2. Juni 2025, 16:03 Uhr von jinkela114514
As a fillomino puzzle, regions of same sizes cannot be orthogonally adjacent, which isn't mentioned in the rules.

am 11. Mai 2025, 04:27 Uhr von VeroBloom
Wonderful start to a logical finish. 77 minutes to solve after quite a bit of wandering at the beginning.

am 26. April 2025, 03:42 Uhr von Calvinball
I would argue it's not just sufficient, but efficient to boot. And also happens to be just bonkers in the best ways possible.

am 25. April 2025, 14:30 Uhr von Snookerfan
Beautiful puzzle! Hard for me to get started, but afterwards smooth. Thank you

am 25. April 2025, 06:24 Uhr von tryote
Very nice deductions

Schwierigkeit:4
Bewertung:96 %
Gelöst:48 mal
Beobachtet:3 mal
ID:000N28

Lösung abgeben

Lösungscode:

Anmelden