Out of my tiny way
(Eingestellt am 25. Juli 2022, 10:29 Uhr von PrimeWeasel)
Fill the grid with numbers from 1 to 6 such that every row, every column and every region contains each of the numbers from 1 to 6 once. The regions are sets of 6 connected cells which have to be determined. They can not cover any 2x2 region.
Digits in a cell with an arrow show the amount of steps that can be taken within the cells' region to reach an end within the same region. An end is defined as a cell of a region that has walls on all other 3 edges besides the one we used to enter that cell. (So, if there is a 4 in an arrow cell, it means that if you take 4 steps in the given direction, an end within the region can be reached. These 4 steps can go in any direction after the first initial step in the given direction, but not back to cells already visited before.)
All arrows have been given. And remember, a region can not cover any 2x2 section of the grid.
Example:
Penpa
More difficult versions with the same ruleset can be found here:
7x7
8x8
10x10
Final boss
Lösungscode: Row 6, column 6
Kommentare
am 7. September 2023, 12:39 Uhr von Christounet
Good fun and lovely introduction to the concept. Glad I have 3 other puzzles to keep playing with that rule !
am 28. August 2023, 12:13 Uhr von morgannamodeaura
The "can" in "the amount of steps that CAN be taken" is doing a lot of work here. Also, I never used either the "a region can not cover any 2x2 section" or the "all arrows are given" rules. Still, this is a very cool idea, and I'm going to try the harder puzzles.
Either the solution checker is not enabled in Penpa, or it doesn't work.
~Thanks for the feedback. I think I didn't know how to make the solution checker work back then, I might update it soon, the same seems to apply to the 7x7.
Since this was more of a tutorial, the all arrows are given is indeed not needed at all, but will certainly be needed for the bigger versions. The no 2x2 rule is needed to have actual paths, and will indeed also matter more for the bigger versions. Good luck with those!
am 3. August 2023, 00:34 Uhr von The Book Wyrm
Nice puzzle. It's a cool ruleset, and the negative constraint is interesting.
I think it could have been clarified that branching regions are allowed, and that the arrows only count one possible path.
am 18. Juni 2023, 15:53 Uhr von Starstorm
The rules should be clarified a bit IMO. As per my correct solution, the arrows specify not the amount of possible steps, but the amount of steps in one possible route in the specified direction, which is subtly but meaningfully different.
That said, it's a neat puzzle and I had fun :)
am 30. November 2022, 00:39 Uhr von Agent
Very hard, the rules are too long.
am 22. September 2022, 17:35 Uhr von PjotrV
I broke this several times, but that is because I was a little bit dumb :)
I loved the ruleset and the fact that a Chaos Construction can also be genuinely approachable :) Thanks Primeweasel!
am 6. September 2022, 13:37 Uhr von lesser_scholar
Neat. For a while I was confused by the rules and thought I had broken the puzzle when it was still correct.
am 17. August 2022, 15:20 Uhr von Sktx
Two records broken :
- easiest CC ever created
- hardest (ruleset/solve path) difficulty ratio.
am 31. Juli 2022, 17:51 Uhr von grkles
Nice!
am 28. Juli 2022, 03:49 Uhr von Drawoon
penpa+: https://tinyurl.com/26nfcfym
am 26. Juli 2022, 20:46 Uhr von DiMono
That was fun. I didn't use the negative constraint, but I did almost make the same mistake I believe was made in the hidden comment. It's an easy wrong conclusion to come to.
~Thanks DiMono, and I admit to having put a tiny little trap in there :)
am 26. Juli 2022, 00:27 Uhr von thoughtbyte
Wonderful, approachable, very fun CC! Thanks!
~Glad you liked it!
am 25. Juli 2022, 11:30 Uhr von Piatato
Cute one. :-)
~Thanks!
