This was intended as practice for Jonas's alphabet contest, but it turned out much too difficult (probably worth >100 points). Hopefully it is still somewhat useful.
Draw a single, non-intersecting loop that only consists of horizontal and vertical segments between the
dots. Numbers inside a cell indicate how many of the edges of that cell are part of the loop.
Additionally, each row and each column must contain exactly one 0, that is, a square with none of its
edges used by the loop.
Solution code: For each row, enter the number of cells inside the loop.
Last changed on on 4. May 2020, 18:04
Solved by rob, JonaS2010, EctoPlasma, cdwg2000, r45, Statistica, NikolaZ, Nylimb, Joe Average, ManuH, uvo, ch1983, Julianl, rimodech, zorant, Alex, jessica6, Zzzyxas, Quetzal, usp, pwahs, amitsowani, moss, ... ibag, Kpn, pirx, numdegased, Dandelo, ildiko, Colcop, Madmahogany, MagnusJosefsson, Jesper, EKBM, moeve, Realshaggy, polar, Vebby, misko, ChristJan, bacad, bakpao, Mark Sweep, UNP, teff, jkuo7
Comments
on 26. January 2022, 01:55 by Vebby
Link to solve on puzz.link: https://tinyurl.com/287jpc3k
on 6. May 2020, 22:17 by usp
very nice puzzle, reminded me of my own puzzle https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=000271, though the rules are not quite the same
on 5. May 2020, 10:37 by Joe Average
Less difficult than you made it sound; great puzzle!!
on 4. May 2020, 21:44 by JonaS2010
Great puzzle!
on 4. May 2020, 18:04 by Puzzle_Maestro
Grammar
on 4. May 2020, 18:02 by Realshaggy
Here is another training puzzle:
https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?chlang=en&id=000394