Slalomzoo 2: Schlange, Tiger und Orang-Utan
(Published on 9. October 2011, 16:02 by rob)
The map consists of animals, fenced enclosures and a path. The segments of type animal, fence or path must not touch the other types. Furthermore, different animals must not be connected.
The path must not have any loops; the fences may only form loops that enclose animals. Every animal must be placed separately into such an enclosure, and every fence must be connected to an enclosure. Moreover, there must be no double fences: If two adjacent cells contain fence segments, then those segments must touch.
Finally, the given numbers specify how many diagonals end in the corresponding vertex.
An example of such a map is here:
The puzzle:
Solution code: For each vertex in the marked row and column, enter the number of diagonals that end there.
Comments
on 12. December 2021, 00:09 by ScatterBrain
Never seen this type of puzzle before. Thanks!
on 12. October 2011, 14:13 by rob
ein paar Labels mehr
