Nanameguri Geradeweg #2
(Published on 5. June 2025, 17:12 by Nell Gwyn)
- Nanameguri and Geradeweg:
- Draw a single closed loop through the centers of some cells. The loop only moves orthogonally and cannot visit the same cell more than once.
- Nanameguri:
- The loop enters and exits each outlined region exactly once.
- The loop must visit every cell with a diagonal line.
- The loop cannot travel through a diagonal line.
- Geradeweg:
- The loop must visit every circle.
- The digit in a circle is the length of every straight line segment that enters that cell (if the loop turns on a circle, each segment must be the same length).
- A question mark may represent any number.
Penpa
Penpa (example puzzle)
Solution code: For each row from top to bottom, the number of times the loop crosses a vertical cell border in that row (in the example puzzle, this would be 4223214)
Solved by Mr_tn, Nylimb, Christounet, aqjhs, Piatato, Jesper, csilva, MaizeGator, sfushidahardy, puzzler05, Dragonslayer, Grausbert, MattYDdraig, ns08, TheZwierz, fkib, r45, Calesch, misko, mdjvz, Kirnball, Zzzyxas, wisty, awesomesauce
Comments
on 6. July 2025, 21:44 by wisty
Tricky and fun!
on 5. June 2025, 21:59 by Piatato
Easy and fun!