Longest Piece Loop
(Published on 14. August 2010, 18:11 by yureklis)
Draw a single closed loop into the grid, moving only horizontally or vertically passing through the center of each white cell without crossing itself. The loop goes through all white cells once. Numbers in the grid indicate the length of the longest loop segment going along that direction (Horizontal pieces for rows, vertical pieces for columns). A number can see all cells in that direction, ignoring the blackened cells.
Solution code: Write the lengths of horizontal pieces in the marked rows, left to right and top to bottom.
Comments
on 2. January 2011, 12:33 by Micha
Nice one!
on 17. August 2010, 20:32 by CHalb
A very good loop-variation. I had a lot of fun during my four tries.
on 17. August 2010, 18:05 by HaSe
great
on 15. August 2010, 16:30 by logik66
Very nice and in a logic way to solve.
on 14. August 2010, 23:03 by r45
Schön flüssig zu lösen, danke.
@CHalb: Für das Rätselsymbol "Wege und Pfade" lautet der Lösungscode (Zeile für Zeile): 2111
Eine Null habe ich im Lösungscode nicht verwendet.
on 14. August 2010, 22:49 by ibag
@chalb: die tatsächliche Länge, also Anzahl der Kästchen -1
on 14. August 2010, 22:25 by CHalb
Is the length of a loop segment meant to be the actual length (taking the length of a square as 1) or the number of connected squares (which is always by 1 one larger than the actual length)?
on 14. August 2010, 19:44 by ibag
Alle markierten Reihen gefunden! ;-))
