Antiknight Slitherlink
(Published on 27. April 2021, 08:25 by Geoteve)
Fill 0~3 in every non-red cell of the grid. Cells separated by a chess knight's move cannot contain the same digit.
Draw a single continuous loop by connecting neighboring dots along the dotted lines. The numbers indicate how many edges of a cell are used for the loop. The loop may not touch or cross itself, and it doesn't need to touch all of the dots.
You can try this puzzle on Penpa+.
Solution code: Digits in row 4 and column 5.
Comments
on 27. October 2022, 23:05 by Nell Gwyn
Fascinating concept, and good execution as well.
on 10. August 2021, 15:54 by uvo_mod
Labels ergänzt: Online Solving Tool und Rätselvariante.
on 1. May 2021, 11:30 by DukeBG
I loved the idea of the constraints, but the red squares were a bit of a bummer. I wonder if it's possible to construct a puzzle with these rules without them.
on 29. April 2021, 18:33 by CHalb
@WallE-93: In the English instruction it says: The loop may not touch or cross itself...
on 29. April 2021, 10:26 by cdwg2000
@WallE-93
If you need it, I can give you a hint. You can find me by email: 2088426@qq.com.
on 29. April 2021, 09:58 by WallE-93
@cdwg2000 thats what i did and i always come to a contradiction so far ^^ letst see. i try it again
on 27. April 2021, 12:48 by SirWoezel
I didn't think this was simple at all, but I never did a Slitherlink puzzle before. Very enjoyable...
on 27. April 2021, 12:00 by cdwg2000
@WallE-93
I think this is a simple question. You can mark the possible numbers 0-3 for each grid according to the anti-knight restriction, and then start drawing the loop.
on 27. April 2021, 11:56 by WallE-93
i dont know why but i am trying sice 3 hours and cant solve it.
