Logic Masters Deutschland e.V.

Chaos Construc-to-N

(Eingestellt am 15. Oktober 2025, 20:10 Uhr von mellowrobinson)

Up to N-sums are so cool, I couldn't help but make them into a Chaos Construction. Thanks to all testers and of course sujoyku for the ruleset. I hope you enjoy it!

  • Chaos Construction:
  • Divide the grid into nine orthogonally connected regions, each consisting of nine cells. Fill every cell with a digit 1-9 without repeats in any row, column, or region.
  • Up to N-sums:
  • A clue outside the Row or Column N indicates the sum of all digits up to the cell that contains the digit N. (The digit N itself is not included in the sum.)
  • A question mark (?) stands for any number greater than zero.
  • Additionally, all digits up to the digit N are in the same region, and the digit N is in a different region.

Solve On Sudokupad

Lösungscode: Row 3, with dashes (-) for internal region borders e.g. 123-45-678-9


Gelöst von Calvinball, chinesemaster, zakkai, VicJameson, dkfan9, e5ten, jakestilesowen, mathpesto, MaizeGator, Chaossudokusplease, Calesch, shifman23, by81996672, brandon_bot, starfall, zardoz37, zeniko, OJPS, ... NicoD, randall, Asphodel, W1n5t0n, Ton, jkuo7, QuiltyAsCharged, agvard, redgecko, Firmus, Lor, Fasdr, Plastosia, PancakePie, pepe74287, Romordis, Zibl, ManuH, Taeqle, Pfanni, nixxo, PrideVPrejudice
Komplette Liste

Kommentare

am 27. Oktober 2025, 08:31 Uhr von PancakePie
Very hard, but very fun! I'd say 4 star difficulty for me, but once I found that one piece of logic, the journey was a blast. Thank you for this beauty!

am 20. Oktober 2025, 20:55 Uhr von dzamie
This was tough! I got stuck a couple of times (admittedly, one of them was from not realizing I'd double-tapped a pencilmark and erased it), but it stayed engaging throughout.
Always nice to find a CC puzzle I can actually do, heh.

am 18. Oktober 2025, 22:54 Uhr von Exigus
Brilliant construction, thanks!

am 17. Oktober 2025, 20:47 Uhr von AdarshN
Really lovely construction, finding where the constraints were acting was a real joy the whole time.

am 17. Oktober 2025, 01:14 Uhr von ThePedallingPianist
This is such a smooth and satisfying puzzle, with a beautiful break in and a decent but never unreasonable level of spice right to the end! Superb construc-to-n! :)

am 16. Oktober 2025, 19:46 Uhr von wuc
Awesome setting. The last idea was more tricky to me than all the rest. Great fun thx.

am 16. Oktober 2025, 14:23 Uhr von Franjo
A wonderful CC! Thank you very much for creating and sharing this beautiful puzzle.

am 16. Oktober 2025, 13:57 Uhr von Christounet
Cool idea. Thanks :)

am 16. Oktober 2025, 12:34 Uhr von Manta-Ray
That was amazing! Very approachable and smooth solve, thanks!

am 16. Oktober 2025, 11:12 Uhr von Snookerfan
Brilliant puzzle! The rules interact really nice. Thank you

am 16. Oktober 2025, 10:08 Uhr von Fizz
That was a lot of fun, thanks a lot!

am 16. Oktober 2025, 08:16 Uhr von zardoz37
I found this quite challenging, but there's no doubt it's beautifully set.

am 16. Oktober 2025, 04:12 Uhr von Chaossudokusplease
Great chaos puzzle, felt pretty approachable! I kept forgetting that there were some actual totals among the question marks which lost me a lot of time haha

am 16. Oktober 2025, 01:53 Uhr von mathpesto
A fantastic chaos construction!

am 16. Oktober 2025, 01:42 Uhr von jakestilesowen
The world needs more chaos construction and this is a shining example of it in top form! Thanks for the puzzle.

am 16. Oktober 2025, 00:41 Uhr von dkfan9
Excellent! I am not often a fan of chaos puzzles but the N constraint made this one approachable and very fun.

am 16. Oktober 2025, 00:35 Uhr von VicJameson
Fun ruleset. Don't think I've come across it before, but the way it all unfolded was lovely. Thanks so much.

am 15. Oktober 2025, 20:24 Uhr von Calvinball
Loved this usage of up to N, some really fun and powerful interactions in here. Excited to forget this puzzle so I can solve it again in the future.

Schwierigkeit:3
Bewertung:96 %
Gelöst:134 mal
Beobachtet:1 mal
ID:000PMD

Standardrätsel

Lösung abgeben

Lösungscode:

Anmelden