Rules
Draw two non-branching, non-self-crossing loops that move orthogonally through the centers of some cells. Every cell not containing a black circle must be visited by exactly one of the two loops. Cells with a black circle are visited by either no or both loops. If visited by both, the two loops must cross, but not turn at their intersection or otherwise overlap. Neither loop may pass through solid cell borders, if given.
I recommend drawing the loops in contrasting colors while solving. If you want the answer check to trigger, you will need to trace over all lines in green.
Here is a small example to illustrate the rules. You can try solving the example online here (no answer check).
Lösungscode: Row 6, encoded by: Vertical segment=V, Horizontal segment=H, Corner segment=C, Dot with no segment=D, Crossing segments=X.
am 30. September 2023, 20:42 Uhr von Niverio
Lovely puzzle! The deductions just kept on coming and coming.
am 28. Dezember 2022, 16:40 Uhr von ONeill
Great puzzle! This ruleset is a lot of fun, thanks Ambrose :)
am 28. Dezember 2022, 15:32 Uhr von Ambrose
Corrected puzzle link.
am 28. Dezember 2022, 15:19 Uhr von Ambrose
Thanks to zetamath for introducing me to this rule set, which he re-discovered (apparently originally by Inaba Naoki).