Logic Masters Deutschland e.V.

Position Sums: Fillomino (11x11)

(Published on 20. October 2022, 05:59 by 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.

Solution code: Row 9 followed by column 8

Last changed on on 22. October 2022, 08:30

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

Comments

on 28. July 2023, 13:57 by Piatato
Great fun! Very smooth throughout :)

on 13. May 2023, 18:40 by Bootenks
I am very glad, that I have stumbled over your awesome puzzle.

Chapeau for being able to create such a great masterpiece.

on 12. April 2023, 15:15 by 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!

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

on 28. October 2022, 21:02 by StephenR
Excellent puzzle, thanks. Felt sure I'd break it at some point, but miraculously I didn't.

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

on 22. October 2022, 03:42 by Agent
Wonderful puzzle! Splendid execution of the ruleset. The Fillomimo seemed to fall into place magically.

on 21. October 2022, 22:35 by 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 !

on 21. October 2022, 16:10 by MagnusJosefsson
Another great puzzle, very nice idea to combine positions sums with Fillomino!

on 21. October 2022, 00:45 by Steven R
Lovely stuff!

on 20. October 2022, 23:22 by Vebby
Very interesting and enjoyable logic, thanks ONeill!

on 20. October 2022, 20:19 by 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!

Last changed on 20. October 2022, 13:50

on 20. October 2022, 13:43 by 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!)

on 20. October 2022, 12:39 by Jesper
Great puzzle, really enjoyed it! Easier than it looks at first glance.

on 20. October 2022, 09:35 by polar
Really fun combination! Thanks very much :)

@glum_hippo yes indeed that's right

Difficulty:4
Rating:100 %
Solved:37 times
Observed:3 times
ID:000BPD

Enter solution

Solution code:

Login