Linesweeper 1
(Published on 29. August 2020, 15:17 by Lizzy01)
I found this puzzletype here: https://www.janko.at/Raetsel/Linesweeper/index.htm
This is one I set myself:
Rules:
Draw a single closed loop in the grid (that doesn't branch or cross itself). A number in a cell indicates how many of the 8 adjacent cells are visited by the loop. The sections of the loop run horizontally and vertically between the centers of horizontally and vertically adjacent cells. The loop never visites a cell with a number in it.
Solution code: row 2, row 8 (1 for straight loop, L for bent loop, 0 for no loop)
Solved by stefliew, Zzzyxas, apiad, ManuH, athin, saskia-daniela, cdwg2000, Dandelo, Jesper, Voyager, Puzzle_Maestro, NikolaZ, karen_birgitta, moss, rimodech, Greg, Nothere, Mody, ffricke, kroutu, CHalb, ... AndreasS, Matt, shedarshian, pokerke, dandbdi, Uhu, SudokuExplorer, Thomster, Mathi, Raistlen, misko, marsigel, CJK, ildiko, derwolf23, Dugong, Mark Sweep, hopppe, Jordan Timm, puzzler05, drf93
Comments
on 7. September 2020, 10:46 by 103percentjak
Humblebrag. I'm the inventor of this puzzle type.
