O'Position [Ciphered Position Sums Fillomino]
(Published on 30. April 2023, 22:51 by Christounet)
This puzzle was created as a birthday gift for ONeill, who very supportively tested all of my first puzzles and helped me get confidence in my setting skills. I chose to make a position sums fillomino, because these are 2 of his favorite constraints, as you'll see if you look at the puzzles he set. I also added a bit of ciphering to it, because it's fun and allowed me to use the letters for the design too. I'm publishing this with his permission and encouragement. This version is slightly easier than the one he solved. I decided to modify a couple of clues to make it smoother.
Thanks to polar for testing both versions !
If you have trouble understanding how position clues work, check out the solvable example puzzle that I made to illustrate them.
Rules :
- Fillomino : 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.
- Position Sums : let A and B be the digits in the first and second cells of the grid from any direction (row, column, main diagonals).
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 (A and B must both have valid indexing values). 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.
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.
Clues are ciphered. "?" is a stand in for any digit 0-9, but for a double digit number, the first digit may not be 0. Each distinct letter represents some unique digit from 0 to 9. The letters appearing in grid cells will have to be replaced by the corresponding digit.
Note : the 2 dashed rectangles with "A+B" and "Ath+Bth" are not actual clues. They just show the nature of each ring of clues.
Example : SMOL
The puzzle :
Enjoy ! And consider leaving a comment if you appreciate the puzzle !
You can check out my other puzzles here if you liked this one.
Solution code: All the numbers on the negative diagonal, from top left corner to bottom right corner, followed by the digits of the code ONEILPS, from top to bottom
Comments
on 23. March 2024, 10:29 by Piatato
Very challenging and all the more satisfying to figure out :D
on 2. August 2023, 00:04 by Bellsita
That almost broke my brain but it was worth every minute! Great puzzle!
on 8. May 2023, 20:00 by Myxo
An amazing journey. I loved it!
---
@Myxo : Thanks ! I'm glad you had a good time :)
on 6. May 2023, 12:08 by marcmees
Very challenging. Thanks. Belated Happy birthday O'Neil.
---
@marcmees : Thanks. This was probably the most challenging puzzle I've ever set. I'm glad great solvers like you and others enjoyed it :)
on 3. May 2023, 12:45 by ONeill
Brilliant! I really had to think hard to make progress with this one, and loved the whole solve path. Thanks so much for this gift, I hope others enjoy it as much as I did :)
---
@ONeill : So happy you enjoyed that birthday gift that much !! I had to work hard to make it as tough as you'd like it !
on 2. May 2023, 23:29 by lerroyy
Very nice! But it was very hard for me.
---
@lerroyy : Very hard for you must be very very hard for some other people !
on 2. May 2023, 17:47 by Paquet Voleur
Wow! This was very tough for me, but what an amazing feeling when everything fell into place. I reached the finish line with a sense of disbelief that no mistakes were forgotten along the way! Hats off Christounet!
---
@Paquet Voleur : Thanks, I'm glad you liked the way it unfolded after a tough solve !
on 2. May 2023, 13:04 by Christounet
Added an example puzzle.
on 1. May 2023, 17:14 by polar
Really enjoyed some of the trickier steps in this puzzle. So pleased that O'Neill enjoyed them too! Happy belated birthday O'Neill!
---
@polar : Thanks :)
on 1. May 2023, 10:44 by MicroStudy
happy birthday oneill!!!!
