16
$\begingroup$

Basic rules

Form a loop using the dots (so, by joining orthogonally adjacent dots) such that a number N is surrounded by exactly N segments of the loop. Here's a tutorial puzzle and its unique solution:

enter image description here

enter image description here

Actual puzzle

Here's an easy-ish slitherlink. A solution has been checked, and it should be fine, but sorry if there's any ambiguity that got past the checks.

enter image description here

or play online. Have fun!

Improve this question
$\endgroup$
1
  • 3
    $\begingroup$ Wow. That's impressive. $\endgroup$
    – Deusovi ♦
    Commented Dec 13, 2017 at 3:48

2 Answers 2

Reset to default
8
$\begingroup$

Solved it! It was a lot of fun!

Improve this answer
$\endgroup$
8
$\begingroup$

I'd like to point out that there are actually two answers, so this Slitherlink is not solvable through pure logic:

Answer 1

and:

Answer 2

differing in this little region:

Part solvable through logic

To fix the problem, I think it is possible to:

Swap the bottom 1 and 2 around

Improve this answer
$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.