Draw a loop into the diagram that runs along the edges of the tiles. The numbers inside the loop indicate how many edges of the tile the loop passes through. The numbers outside the loop indicate how often the loop touches the tile. An example:
And here comes the puzzle:
Solution code: First the number of orthogonally connected regions outside the loop. Then the sizes of the 3 biggest regions outside in decreasing order (for the example 4 13 3 1).
on 18. January 2020, 19:30 by Lucx
Tolle Idee - hat sehr viel Spaß gemacht! vielen Dank!
on 2. November 2019, 15:04 by Rollo
Sogar das Beispiel ist Extraklasse! Ich wollt's mal eben schnell lösen: Satz mit x.