Logic Masters Deutschland e.V.

Killomino

(Published on 9. July 2022, 04:16 by 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+

Solution code: Row 2

Last changed on on 12. November 2022, 00:56

Solved by 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
Full list

Comments

on 5. March 2024, 05:54 by Qwazim0d0
Great puzzle!

Last changed on 30. November 2022, 16:19

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

on 12. November 2022, 00:56 by josh_johnson
Fixed label of Penpa link

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

on 16. July 2022, 00:56 by PulverizingPancake
Ending was a bit thorny for me but I enjoyed it for the most part!

on 13. July 2022, 20:59 by 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!

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

Difficulty:4
Rating:93 %
Solved:49 times
Observed:5 times
ID:000AFO

Enter solution

Solution code:

Login