Lösungscode: Enter the number of edges that are part of the loop incident to each cell in row 2 and 5.
am 16. Januar 2026, 20:20 Uhr von logicanimal
@JustinTucker, ah, I think the confusion is in the definition of "region". A region is purely defined by the loop itself, no further separation is needed. So if you look at any particular unit square, the region it belong to is all the unit squares it can reach without ever crossing the loop. If it can reach the region outside the entire grid, then it is "an outside region". All the other regions are inside the loop. These inside regions, all except for one, must be snakes on its own (without further division).
Also, a given number may correspond to both the number of edges and the size of the snake region.
(The screenshot was helpful. Thanks!)
am 13. Januar 2026, 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?