Logic Masters Deutschland e.V.

Position Sums: Fillomino (11x11)

(Eingestellt am 20. Oktober 2022, 05:59 Uhr von ONeill)

I'm a big fan of Fillomino Variants and enjoyed setting my Position Sums CC so I thought I'd have a go at combining the two. I hope you like it!

Rules:

1. Divide the grid into regions so that no two regions of the same size share an edge. Enter a number into each cell equal to the size of its region.

2. Let A and B be the digits in the first and second cells of the grid from any direction
a) Unshaded clues outside the grid indicate the sum of A and B
b) Shaded clues indicate the sum of the digits in positions A and B from that direction. Note that it is possible that A and B index the same cell. If A and B index the same cell, the sum is twice the value of the cell they index.

3. If a clue is circled, the cells that are part of its sum belong to the same region. If a clue is not circled, the cells that are part of its sum belong to different regions.

4. A question mark can stand for any positive integer (including 2-digit numbers).

I have created an example puzzle which you can play here.

Example puzzle:



The main puzzle:

Penpa+: Position Sums: Fillomino (11x11)

Answer check is enabled with digits or edges.

Lösungscode: Row 9 followed by column 8

Zuletzt geändert am 22. Oktober 2022, 08:30 Uhr

Gelöst von polar, Jesper, jkuo7, glum_hippo, KNT, Niverio, Vebby, angusg, cdwg2000, Steven R, kjholt, MagnusJosefsson, meixia, Christounet, Agent, marcmees, Dandelo, ascension, StephenR, misko, Statistica, Mark Sweep, filuta, cmb, SudokuExplorer, Uhu, ManuH, h5663454, Paquet Voleur, Bootenks, Piatato, Tom-dz, pandiani42, lerroyy, Asphodel, Paletron
Komplette Liste

Kommentare

am 28. Juli 2023, 13:57 Uhr von Piatato
Great fun! Very smooth throughout :)

am 13. Mai 2023, 18:40 Uhr von Bootenks
I am very glad, that I have stumbled over your awesome puzzle.

Chapeau for being able to create such a great masterpiece.

am 12. April 2023, 15:15 Uhr von Paquet Voleur
Very impressive! I had to let it sit there because I couldn't figure out a certain step, but woke up with a possible answer this morning, went to try it, and it worked. Thanks for this beautiful puzzle!

am 13. November 2022, 21:05 Uhr von filuta
beautiful! especially cool when both clue types are combined for a row/column.

am 28. Oktober 2022, 21:02 Uhr von StephenR
Excellent puzzle, thanks. Felt sure I'd break it at some point, but miraculously I didn't.

am 22. Oktober 2022, 12:54 Uhr von marcmees
I must have missed the rule about doubling the sum when indexed twice. rereading the rules sometimes helps :-)
nice. thanks.

am 22. Oktober 2022, 03:42 Uhr von Agent
Wonderful puzzle! Splendid execution of the ruleset. The Fillomimo seemed to fall into place magically.

am 21. Oktober 2022, 22:35 Uhr von Christounet
Loved the combination ! You really got everything right here, the nice logic, the clarity of the path, the tightness of the fillomino, even the clues have a nice symmetric touch to them. What an impressive follow up to your 1st puzzle! Hats off !

am 21. Oktober 2022, 16:10 Uhr von MagnusJosefsson
Another great puzzle, very nice idea to combine positions sums with Fillomino!

am 21. Oktober 2022, 00:45 Uhr von Steven R
Lovely stuff!

am 20. Oktober 2022, 23:22 Uhr von Vebby
Very interesting and enjoyable logic, thanks ONeill!

am 20. Oktober 2022, 20:19 Uhr von Niverio
I love seeing your initial puzzles being an absolute blast to solve, as it means that you can only go higher from where you are ;) Awesome stuff!

Zuletzt geändert am 20. Oktober 2022, 13:50 Uhr

am 20. Oktober 2022, 13:43 Uhr von glum_hippo
A very nice idea, and elegantly executed! I hope this gets more attention as it's not too difficult. Especially the economy of clues makes it clear where to look. (Also, a very aptly chosen solution code!)

am 20. Oktober 2022, 12:39 Uhr von Jesper
Great puzzle, really enjoyed it! Easier than it looks at first glance.

am 20. Oktober 2022, 09:35 Uhr von polar
Really fun combination! Thanks very much :)

@glum_hippo yes indeed that's right

Schwierigkeit:4
Bewertung:100 %
Gelöst:36 mal
Beobachtet:3 mal
ID:000BPD

Lösung abgeben

Lösungscode:

Anmelden