Logic Masters Deutschland e.V.

Killomino

(Eingestellt am 9. Juli 2022, 04:16 Uhr von josh_johnson)

Fillomino: Divide the grid into regions called polyominoes so that no two polyominoes with the same area share an edge. Each cell contains a digit which is the size of the polyomino, where the maximum is 9.

Cages: The numbers in a cage add up to the number in the top left corner of that cage. Numbers MAY REPEAT inside a cage.

Little killer: Little killer clues show the sum of the numbers on the diagonal it is pointing at. Numbers can repeat on the diagonal

CTC

Penpa+

Lösungscode: Row 2

Zuletzt geändert am 12. November 2022, 00:56 Uhr

Gelöst von Jesper, jessica6, rimodech, Samish, moeve, barer, bernhard, StephenR, PulverizingPancake, djorr, MagnusJosefsson, misko, moss, Statistica, Dentones, zorant, soroush, dimension7, polar, hurrdurr, ... jkuo7, mormagli, SKORP17, OGRussHood, Jaych, kjholt, Christounet, Mark Sweep, Nell Gwyn, GexTed, PippoForte, Steven R, GabeSzeto, Gotroch, sth, Qwazim0d0, dogfarts, Calesch, Bibet, ab3defc
Komplette Liste

Kommentare

am 5. März 2024, 05:54 Uhr von Qwazim0d0
Great puzzle!

Zuletzt geändert am 30. November 2022, 16:19 Uhr

am 30. November 2022, 16:18 Uhr von Christounet
Nice fillomino variant ! Nothing too complicated, but a careful observation to get the right configurations in the second half. Thanks.

am 12. November 2022, 00:56 Uhr von josh_johnson
Fixed label of Penpa link

am 7. November 2022, 08:46 Uhr von kjholt
Just a note that your link to f-puzzles is actually to Penpa+.

am 16. Juli 2022, 00:56 Uhr von PulverizingPancake
Ending was a bit thorny for me but I enjoyed it for the most part!

am 13. Juli 2022, 20:59 Uhr von StephenR
Great puzzle, thanks. Think this combination, which I haven't seen before, has legs. Just need to remember you're not doing sudoku and numbers can repeat in cages, rows and columns!

am 9. Juli 2022, 14:24 Uhr von Samish
I love the association of fillominos and killer clues ! Very pleasant to solve, a lot of nice logic to spot. Thank you !

Schwierigkeit:4
Bewertung:93 %
Gelöst:49 mal
Beobachtet:5 mal
ID:000AFO

Lösung abgeben

Lösungscode:

Anmelden