Slitherdoku
(Published on 31. July 2021, 02:56 by Asimir)
Place the digits 0 to 8 in the grid such that each digit appears exactly once in each row, column and box.
The finished grid should contain a single continuous loop which does not cross or touch itself, such that every 0, 1, 2 and 3 shows the number of loop segments bordering that cell.
The sum of all digits inside the loop is equal to the sum of all digits outside the loop.
penpa: https://git.io/JW1aM
Solution code: Rows 3 and 7
Solved by denniscch, Prutsbeest, Nusi, DiMono, bernhard, PiBar, zorant, heckmanity, siuminaga, misko, Angizia, cdwg2000, CJK, bob, bacad, Siebuhh, Dandelo, cha, schlathubali, jkuo7
Comments
on 16. September 2021, 07:37 by cdwg2000
Very nice!
