Haisu mit Kreuzungen
(Published on 20. November 2022, 17:34 by Dandelo)
Draw a path from S to G that connects the centers of orthogonally adjacent squares and uses all squares. The path crosses itself at the given places and enters all other squares exactly once.
If the path enters a square with a number N, it is on its N-th entry to the region which contains it.
Solution code: For each row the number of horizontal segments.
Last changed on on 20. November 2022, 23:08
Solved by Mark Sweep, lupo, polar, Jesper, jessica6, CJK, uvo
Comments
on 21. November 2022, 17:16 by Jesper
Very nice, good implementation!
on 21. November 2022, 07:57 by polar
Great puzzle - thanks!
on 20. November 2022, 23:11 by Dandelo
Solution code added to Penpa.
on 20. November 2022, 23:01 by Mark Sweep
Had great fun with this puzzle. Very interesting logic in there.
on 20. November 2022, 22:57 by Dandelo
Penpa version corrected. Sorry again. Thx to Mark Sweep for noticing.
on 20. November 2022, 22:51 by Dandelo
Fehlerhafte Version korrigiert. Die 4 oben in der Mitte war eine 3.
Puzzle corrected.
on 20. November 2022, 22:43 by Dandelo
Oops. There is a mistake. The 3 in row 2 must be a 4. Sorry!
