Way out of my way
(Eingestellt am 1. September 2022, 20:36 Uhr von PrimeWeasel)
Fill the grid with the numbers from 1 to 5 such that every row and every column contains these digits twice, but identical digits can not touch orthogonally (horizontally or vertically). The grid consists of 20 regions which contain each of the numbers from 1 to 5 once. These regions are sets of 5 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.
Way out
A 6x6 tutorial with example can be found here: 6x6
Lösungscode: Column 2, Row 9
Kommentare
am 17. November 2023, 11:32 Uhr von PrimeWeasel
Missing arrow
am 16. November 2023, 20:41 Uhr von ONeill
Very nice ;)
am 17. September 2022, 21:39 Uhr von profanat
Nice puzzle, missed one possibility for a region and spent hour fixing
am 10. September 2022, 01:39 Uhr von KNT
Well that was... weird. Fun puzzle
am 5. September 2022, 10:51 Uhr von jessica6
How do I have to interpret the "all arrows are given" rule?
1) if there is an X in a cell with an arrow, all ends are X steps away
2) if there is an X in a cell with an arrow, at least one end is X steps away
3) if there is an X in a cell, and at least one end can be reached in X steps, this cell must have arrows pointing to each end which can be reached in X steps
These constraints are not exactly equivalent, so which one is right?
~ hi jessica, sorry for the confusion. I think the 3rd one sums it up best, but 2 is right as well. If there is an X in a cell with an arrow, then in the given direction(s), an end (or multiple ends) will be reached. 1 is certainly not true, not all ends have to be reached. Any digit not in a cell with an arrow, can therefore never reach any end of the region.
am 2. September 2022, 10:52 Uhr von marcmees
First half solved smoother than the second half where one gradually needs more attention to the 2x(1-5) constraint. thanks
am 1. September 2022, 23:48 Uhr von Vebby
Very nice! Enjoyed all the little deductions that kept chipping away at the grid. Thanks PrimeWeasel :)
