## Japanese Sum Cave Cipher: Fillomino (Parity)

(Eingestellt am 18. November 2022, 18:32 Uhr von Niverio)

After solving countless awesome puzzles from KNT's Japanese Sum Cave Cipher series, I decided that he shouldn't be allowed to steal all the fun to himself, so set one myself. :)

- Fillomino: Divide the grid into orthogonally connected regions such that no two regions of the same size share an edge, and enter a number into each cell equal to the size of its region.

- Cave: Shade some cells in the grid such that the final shading of the grid resembles a valid cave (all unshaded cells are orthogonally connected and all shaded cells are orthogonally connected by other shaded cells to an edge of the grid).

- Parity :Every region is either entirely shaded or entirely unshaded, and the shading is based on parity: All fillomino's containing one parity form either the wall or the cave shading, and the other parity forms the OTHER shading of the cave. Which parity belongs to which must be deduced by the solver.

- Japanese Sums: Outside clues are Japanese sum clues. "?" 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. Clues also represent the correct digit count, ? is for a single digit number, ?? (or variations thereof, like ?D) is for a double digit number.

- Clues to the left of the grid are Japanese sum clues for either shaded or unshaded groups of cells, where each group needs at least one of the other (shaded or unshaded) to separate the groups. Clues to the top of the grid are Japanese sum clues for the OTHER of shaded or unshaded. (That is, if it turns out clues to the left indicate sums of unshaded blocks, clues to the top indicate sums of shaded blocks).

- For each row or column, either all or no outside clues are given.

Below is an example illustration to showcase how the rule set might work in a 6x6 Fillomino grid:

And below is the main puzzle, available in Penpa+. Answer check is enabled for correct number placement, including the cryptic column. Enjoy!

Lösungscode: Numbers in Row 1, followed by Row 4 (No commas or spaces.)

Gelöst von Jesper, ONeill, MagnusJosefsson, jkuo7, polar, ascension, JayForty, KNT, Playmaker6174, fjam, Vebby, grkles, harrison, peacherwu2, Myxo, Koalagator2, Piatato, Sewerin
Komplette Liste

### Kommentare

am 14. Januar 2023, 12:37 Uhr von Piatato
Great puzzle! I had a lot of fun throughout this one. :-D

am 20. Dezember 2022, 01:17 Uhr von Myxo
Amazing!

am 10. Dezember 2022, 20:42 Uhr von peacherwu2
Amazing puzzle! Thank you so much!

am 24. November 2022, 11:21 Uhr von Vebby
Fantastic idea and puzzle! Made an incorrect assumption regarding c12, but other than that I thought it had a really nice flow throughout. Thanks Niverio! :)

am 22. November 2022, 16:55 Uhr von Playmaker6174
What an awesome and engaging puzzle, even for a fillo noob like me x)
Figuring out the initial start was fairly easy, but things started to hurt my mind as the solve went on, should've got some parts done much earlier but I'm glad that I was that persistent till the very end ;)

am 21. November 2022, 17:49 Uhr von KNT
agreed with @polar, never a huge fan of parity in much of anything, but this had awesome execution. glad to see stuff inspired by me on here as always :)

am 20. November 2022, 20:07 Uhr von JayForty
Great puzzle! Very nice deductions and fun to explore!

am 19. November 2022, 15:22 Uhr von polar
You managed to turn one of my less favoured variants (parity) into a thoroughly enjoyable solve; the mark of a great puzzle! Thanks Niv :)

am 19. November 2022, 01:07 Uhr von MagnusJosefsson
Awesome! Amazing puzzle with a lot of really clear but challenging and satisfying deductions. Thanks you Niverio!

am 18. November 2022, 23:35 Uhr von ONeill
Superb puzzle! The break-in is very nice, and the parity logic is a fun twist. Thanks :)

am 18. November 2022, 19:38 Uhr von Jesper
Great puzzle! So much fun and varied logic, I enjoyed it immensely.

 Schwierigkeit: Bewertung: 100 % Gelöst: 18 mal Beobachtet: 4 mal ID: 000C22

Lösungscode: