Slithering Snakes
(Eingestellt am 30. Dezember 2025, 12:20 Uhr von logicanimal)
Rules: Slitherlink variant
1. Connect orthogonally adjacent dots to form a single loop. The loop may intersect itself. However, if all four edges incident to a dot are used, the loop cannot turn and must travel straight through the dot.
2. The loop divides the grid into 3 types of regions: a) regions outside the loop, b) snake regions inside the loop, and c) a single non-snake region inside the loop. A snake region is an orthogonally connected 1-unit-wide path of two or more squares that never touches itself, not even diagonally.
3. A given number represents either the number of edges surrounding it that are part of the loop, or the size of the snake region containing it.
4. A snake region must contain at least one number indicating its size.
You can solve the puzzle here.
This is one of 12 disjoint puzzles I made this year with varying styles/difficulties themed around snakes and 2025.
Enjoy!
Lösungscode: Enter the number of edges that are part of the loop incident to each cell in row 2 and 5.
Zuletzt geändert -
Kommentare
Gestern, 14:56 Uhr von JustinTucker
I have a solution but the solution code doesn't work. May be that I have a wrong understanding of the rules.
1) "outside the loop" is everything with a path to the border which is not intersecting the loop? "Inside" would be everything else?
2) If this is the case the "inside" could be separated by the loop. May snakes or the non- snake region cross the loop?
3) May a given number represent both properties or is rule three exclusive?
