Feral Forest
(Eingestellt am 11. September 2026, 06:23 Uhr von Aeon)
Puzzle link: Solve in SudokuPad
Chaos construction:
-Divide the grid into nine regions, each made of nine orthogonally connected cells, such that each row, column and nine cell region contains the digits 1 to 9 exactly once each.
L sums:
-Clues outside the grid show the sum of the first X digits from that direction, where X is the first of those digits.
-Each sum line makes one 90° turn at some point, making it some form of an "L" shape. Basically: the sum consists of two straight parts(which consists of 1 or more cells) connected by a "bend". The bend needs to be seen by the clue in the clue's row/column.
-Entire sum is situated in one region. The first cell immediately after the completed sum is of different region.
-Given black borders separates cells of different regions
EXAMPLES:
Lösungscode: Row 5, "-" separating regions. ex: 12-3456-789
Kommentare
am 2. Oktober 2026, 19:29 Uhr von Kafkapharnaum
Another one that I’d postponed long enough, and ha, shall we say that this is quite a bit tougher than the one you said inspired it XD And of course, as always, I had to make it tougher for myself, as at the start I was going with the possibility that an I-shape could be possible, having not looked closely enough at the examples…
I wonder if it might explain why it’s still sitting at such a low number of solves as a CC (which are generally OP'd), since even as the CC part is quite hard, with proper comprehension, the start is pretty smooth and should encourage solvers to see the puzzle through the end. So, sad to see that I didn’t trigger the official rating, but in any case, hats off on this really original construction!
am 24. September 2026, 10:40 Uhr von goldpuffle
Nice puzzle, properly difficult.
am 11. September 2026, 11:39 Uhr von marcmees
Novel twist to the x-sum CC's. Obvious but funky break in. Very nice. Thanks
am 11. September 2026, 07:53 Uhr von Aeon
Examples edited
