Lösungscode: Die Anzahl der Felder, in denen der Rundweg abknickt, zeilenweise von oben nach unten.
am 21. Januar 2022, 12:27 Uhr von Vebby
Link to solve on Penpa+ with answer check (green lines):
https://tinyurl.com/yvh9hhwk
am 29. Juli 2020, 21:27 Uhr von dm_litv
Very nice!
am 27. Juli 2020, 09:21 Uhr von CHalb
After solving and enjoying this puzzle very much I recommended it to my son. We did it together and he explicitly said some times during solving, that this is a great puzzle for him, too.
am 1. April 2020, 19:12 Uhr von tuace
Really nice. It is always exciting to see what other authors do with my puzzle inventions :)
am 25. März 2020, 00:13 Uhr von HaSe
really great puzzle
am 23. März 2020, 17:08 Uhr von Puzzle_Maestro
Your initial assumption is correct. If one visit of a region uses X cells, all subsequent visits must also use X cells.
‘Enter and Leave’ mean exactly what you’d expect them to: crossing the boundaries of the region. Hence, the loop must indeed cross the boundary of each region at least 4 times.
am 23. März 2020, 16:43 Uhr von Circleconstant314
I'm a little bit confused here. If a region is visited only twice, are the number of visited cells per visit still the same? Similarly, if during one visit of a region the loop uses X cells, does this mean any future visits of that same region must use exactly X cells and no more or fewer?
EDIT: Also, what does "enter and leave" mean here? Does the sentence "enter and leave each region at least twice" mean that the loop must cross over the boundary of each region at least four times?
am 23. März 2020, 15:05 Uhr von JonaS2010
Very nice!
am 23. März 2020, 14:03 Uhr von Puzzle_Maestro
Fixed multiple solutions. Thanks to uvo for pointing it out.