or solve online (using our beta test of Penpa-Edit tools; in default linex mode: left-click+drag draws line, right click marks X on edge)
Author/Opus: This is the 10th puzzle from guest contributor Hans van Stippent.
Rules: Draw a single loop in the grid which may cross itself orthogonally, but otherwise does not touch or retrace itself. The clue numbers to the left/right of the rows indicate the number of squares visited by the nearest section of the loop that travels horizontally in the rows. The clue numbers to the top/bottom of the columns indicate the number of squares visited by the nearest section of the loop that travels vertically in the columns.
Also, see this example:
Answer String: Enter the number of empty squares for each row from top to bottom, followed by a comma, and then the number of turns for each row from top to bottom. This example has the key “100000,422224”.
Time Standards (highlight to view): Grandmaster = 1:45, Master = 3:00, Expert = 6:00