In the question Five Slitherlinks, the querent suggests that "each [Slitherlink puzzle has] a complete solution". I'm newly reading about Slitherlinks, but I don't understand what makes a solution "unique". Further, one answer receives commentary that somehow its solution presented is not unique.

Most other forms of puzzle I'm familiar with find the puzzle itself to have the burden of ensuring there's a unique solution, and I'm not sure what this request means in this circumstance.

So what does it mean when Slitherlinks puzzles need unique solutions?

  • 4
    $\begingroup$ You write that "Most other forms of puzzle I'm familiar with find the puzzle itself to have the burden of ensuring there's a unique solution". This is true. It is the grid that guarantees there's a unique solution. But we often say of a solution that it is unique or not unique, depending on whether or not there are other solutions available. In short, saying "the solution is not unique" is just another way of pointing out "the grid does not guarantee a single solution." $\endgroup$ – DyingIsFun Mar 28 '17 at 16:20

As in many grid-deduction puzzles (and for that matter well-posed logical deduction puzzles of all kinds), you can usually deduce the solution by pure logic from the given initial conditions. The fact that you can deduce it shows that it's unique, otherwise you'd find more than one possibility.

If such a puzzle doesn't have a unique solution, then it's arguably not a well-defined puzzle - just like a riddle whose verses could equally well describe more than one different thing.

For example, let's consider the upper-right quadrant of the Five Slitherlinks puzzle:

Initial state

  • There must be exactly two filled segments adjacent to the number "2". We know D2-E2 can't be filled since it's adjacent to a "0"; neither can E2-E3 since then one of the segments adjacent to the "0" would have to be filled. So we can fill D2-D3-E3 right away. From D2, the slithering link can't go to D1 or E2 because of the "0", so it must go to C2. From E3, it can't go to E2 because of the "2", so it must go to E4. So far we have:

    First four segments filled

  • From E4, the slithering link can't go to E5, because then it would have to go to D5 and violate the "1", so it must go to D4. From D4 it can't go to D3 as that would close the loop too early, or to D5 because of the "1", so it must go to C4.

    Next two segments filled

  • There must be exactly one empty segment adjacent to the "3", and it must be either C3-C4 or B4-C4 since we can't have both of these filled. If it's B4-C4 that's empty, then the slithering link goes C4-C3-B3-B4, completing both the "1" and the "3", and then there's no way to make it connect up:


    So the slithering link must go C4-B4-B3-C3, and then it's clear how to finish off:

    Final solution

  • $\begingroup$ Oh! I think I might have been misinterpreting that commentary as criticism of a flaw in the answer -- but it sounds like it was just reassurance to not stress about something? $\endgroup$ – doppelgreener Mar 28 '17 at 16:34
  • $\begingroup$ @doppelgreener If you mean this comment, Silenus is saying that Karan's 5th grid doesn't have a unique solution, so there must be another way of making a 5th grid for a valid puzzle. $\endgroup$ – Rand al'Thor Mar 28 '17 at 16:38
  • 3
    $\begingroup$ @doppelgreener, I referred to a solver's loop as "not unique" because it was one of many possible loops that could be consistently drawn on their grid. This means that the grid they constructed was incorrect. The correct grid has only one possible loop that can be drawn on it. $\endgroup$ – DyingIsFun Mar 28 '17 at 16:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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