I Made A Pencil Puzzle: Fillomino (12x12)
(Eingestellt am 5. November 2023, 12:00 Uhr von Playmaker6174)
I'm back for some more puzzling! For this time, I tried something refreshing instead and branched into other pencil puzzles with some sparkling ideas. Fillomino is one of those genres that I usually find pleasant and fun to solve with, so here's a fillomino with some additional weird twists.
While setting this, I was actually pretty ill and had to lie on my bed for a majority of time but in the end, I got a couple of cool results and the following one was the third result out of them (so there may be more results with much more polished and shortened rule set coming out in the future).
Anyway, I hope you'll find the solve fun overall despite the 'sacrilegious' rule set and the 'bland' puzzle title (only because I couldn't come up with a good name for this) :)
Rules:
- In the 12x12 grid, shade some cells so that the remaining unshaded cells together form a single orthogonally connected region, which will also be able to be divided into smaller orthogonally connected unshaded regions.
The shaded cells that are orthogonally connected together will form their respective shaded region; in addition, a 1 cell shaded region is also possible.
(The region border separates between shaded and unshaded)
-
ALL of the shaded regions AND smaller unshaded regions are fillomino regions: enter into each cell a number that's equal to the size of its region, and no two regions of the same size can touch each other orthogonally (but may touch diagonally), regardless of being shaded or unshaded (we define the size of a region as the number of cells that region consists of).
- Clues outside the grid indicates the lengths of shaded blocks in the corresponding row/column in the given order (top to bottom for columns, left to right for rows), and two shaded blocks are separated by an unshaded block.
A '?' clue represents exactly one clue with an unknown length; an asterisk '*' clue represents an unknown number of clues, which can be zero, one or more than one clue.
[SPECIAL ARROW RULES:]
1) Any given cell with arrow(s) can't be shaded, and
every unshaded fillomino region must contain at least one given cell with arrow(s).
2)
There must be at least one shaded cell found on the direction of an arrow. A number in a cell with arrow(s) indicates the total number of shaded cells that are found along the arrow directions combined.
3) If there's one or more continuous unshaded cells right next to an arrow's direction, those cells
must belong to the same fillomino region as the cell containing that arrow, this is done until the
VERY FIRST shaded cell being found on that direction.
Extra setter note: In this puzzle, not all necessary arrows are given but the fillomino regions division must still satisfy property (1).
The rule set is quite long, but below is a 7x7 example for visualization of how each statement will work. One can also solve this example in
Penpa plus and
Sudokupad.
The main 12x12 puzzle:
Penpa plus -
Sudokupad
Answer check in penpa will activate once all numbers are filled and the shading is done (gray color for cells being shaded). Good luck and have fun solving!
Lösungscode: Enter numbers along column 11 (top to bottom), ?? digits
Gelöst von Myxo, lerroyy, Bellsita, Jesper, KNT, Christounet, Tom-dz, Leonard Hal, h5663454, Snookerfan, ONeill, cdwg2000, jkuo7, Statistica, tuturitu, Mr_tn, ascension, Lindzolt, wand, wildbush7, GTLSE, Joe Average, Vebby, Niverio, Silverstep, Sewerin, sth, TheZwierz
Kommentare
Zuletzt geändert am 20. März 2024, 12:14 Uhram 20. März 2024, 11:59 Uhr von Silverstep
Suggested rewording of some rules:
- Normal fillomino rules apply. Divide the grid into orthogonally connected regions. Two regions of the same size cannot be orthogonally adjacent.
- Shade some cells such that all unshaded cells are orthogonally connected. Each fillomino region is either all shaded or all unshaded. Two shaded regions cannot be orthogonally adjacent.
- Arrows cannot be shaded. Along the direction of each arrow, the first new region it sees (i.e. aside from its own region) must be a shaded region. Each arrow must see at least one shaded region.
am 6. März 2024, 22:28 Uhr von Niverio
Lots of fun!
am 14. November 2023, 17:14 Uhr von wand
enjoyed this one from start to finish. lots of unexpected deductions.
am 13. November 2023, 22:00 Uhr von Lindzolt
You don’t really expect the driving force in the puzzle to be related to the arrows in the way that it is, but I’m glad I ended up reaching the end of the solve after 5 hours!
am 6. November 2023, 18:49 Uhr von Snookerfan
Incredible puzzles, the main one and the example! Very hard for me, but also a great joy to solve. Thank you
am 5. November 2023, 23:57 Uhr von Christounet
I solved a pencil puzzle :)
Very nice until the last bit. Thanks !
am 5. November 2023, 15:46 Uhr von Jesper
Enjoyed it a lot, thanks!
am 5. November 2023, 12:51 Uhr von lerroyy
Really fun puzzle, thanks!
am 5. November 2023, 12:48 Uhr von Myxo
Great puzzle with a lot of really cool deductions! The ruleset seems clunky at first, but it becomes quite intuitive after a bit of solving :)