Draw a loop that travels horizontally and vertically from cell center to cell center and that visits each clue, such that the length of every straight segment that meets a clue is equal to that clue.
Example:Puzzle:
Solution code: Rows 1 and 8 from left to right; L for corners, I for straights, X for empty cells.
on 19. April 2016, 17:59 by rob
Lösungscode korrigiert
on 8. April 2016, 23:23 by rob
Lösungscode vereinfacht
on 22. December 2013, 13:57 by rob
Tags angepasst.
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.