Here is a chaos construction with X-sums, but with a region building rule that is not what is usually used in these puzzles. I initially made this 6x6 grid as an example for the upcoming 9x9 I have set, but I decided to release it first as a little snacky appetizer. Have fun solving!
The puzzle :
Rules :
- Chaos construction : Place the digits 1 to 6 once each in every row, column and region. Regions are orthogonally connected and must be located by the solver.
- X-Sums : Clues outside the grid represent the total of the first X digits in that direction, with X being the digit in the first seen cell. Additionnally, the first and the last cells of the sum belong to the same region. The other cells, if any, don't belong to that region. A question marks represents any digit from 0-9, but for a double digit number, it cannot have a leading 0.
Solution code: Column 5, with hyphens (-) for region borders. (Example: 1-23-456)
yesterday, 23:03 by nunc
Very cool snack! It fell all into place. 1* for me, but I see why it is 2* rated by solvers.
yesterday, 22:49 by damo_89
Very nice, can see how this is a helpful guide to a 9x9..
yesterday, 22:45 by ImpasseduPelican
Beautiful! Tough to rate the difficulty: for the first few minutes it felt like a 3*, but once I got on the wavelength it was smooth as butter, barely over a 1*.
yesterday, 18:58 by GeorgeTheToad2
Finally got there, tripped up by the wording of the other cells.
yesterday, 15:53 by Franjo
Thank you very much for creating and sharing this delicious appetizer. Now I’m feeling a bit hungry …
yesterday, 14:58 by Saltensity
Quite a nice puzzle, though I feel it leans towards 2*. Thank you! :)
yesterday, 14:28 by rojspencer
Either I missed something obvious or this was more of a 3* for me.
yesterday, 14:04 by cyddrdrd
Smooth and cool! Thanks:)
yesterday, 14:02 by abadx
2 stars for me as CC is never a snack for me ;)
yesterday, 12:33 by Piatato
Lovely snack!
yesterday, 11:51 by sujoyku
Wonderfully approachable Chaos Construction! Thank you, Christounet!
| Difficulty: | ![]() |
| Rating: | 96 % |
| Solved: | 45 times |
| Observed: | 1 times |
| ID: | 000V07 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.