Slitherlink Solver

2017-02-11, post № 159

programming, Python, #2016, #puzzle, #shell

Slitherlink is a neat puzzle in which you are presented with a number matrix and the goal is to draw one connected, not interlooping line in between the cells. The number in each cell determines exactly how many line segments must be drawn around each cell (𝟢, 𝟣, 𝟤 or 𝟥). When a cell does not contain any number, the number of line segments adjacent to this cell are unrestricted.

*  *  *  *  *  *          *--*  *  *--*--*
     2  1  3              |  | 2  1| 3   |
*  *  *  *  *  *          *  *--*  *--*  *
        2  2  2           |     | 2  2| 2|
*  *  *  *  *  *          *--*  *--*  *  *
     2              ->       | 2   |  |  |
*  *  *  *  *  *          *  *--*  *--*  *
  1  3  1     1             1  3| 1     1|
*  *  *  *  *  *          *--*--*  *--*  *
  3     2     3           | 3     2|  | 3|
*  *  *  *  *  *          *--*--*--*  *--*

A sample 5x5 Slitherlink with solution.

Slitherlink was invented by the Japanese publisher Nikoli in 1989. It has many other names than “Slitherlink”, yet I prefer this descriptive name. Imagining a snake slithering along the board, seeking to link up with itself is a bit charming.

As with most of these puzzles that have simple rules and are fairly easy to work out by hand — on small scales that is —, writing a solver for them can prove to be more difficult than one may expect.

The first solving strategy I tried out was to brute force the problem. Using the Slitherlink from above as an example, there would be 5\cdot 5=25 different cells with 2\cdot 5\cdot 5+5+5=60 line segments. With each line segment either being drawn or not, there are 2^{60}\approx 1.15\cdot 10^{18} different boards to check. With one board being checked per nanosecond the solver would take \frac{2^{60}}{10^9}\approx 1.15\cdot 10^9 seconds or 𝟥𝟨.𝟧𝟨 years. Brute force is definitely not a viable way to conquer Slitherlink.

After this harsh discovery, I needed a better way to approach solving a given Slitherlink puzzle. Doing some research, I even discovered that Slitherlink is an NP-complete problem (see this paper [1] by Stefan Herting), whereby it — assuming \text{P}\neq\text{NP} — is not even possible to write a solving algorithm which takes polynomial time.
However, solving small Slitherlink puzzles is fortunately possible in a reasonable time frame.

The strategy I used in the solver consists of pre-programmed rules — figured out by humans — which determine parts of the board based on special arrangements and enforcing the puzzle’s rules (such as that there must only be one line). Using those clues, the solver partly solves a given Slitherlink until there are no more known rules to advance. At that point the solver guesses for a given line segment to be either crossed (marking it cannot be drawn) or drawn, building a tree.
Conflicting attempts (where the solver wrongly guessed, then later — through applying the given rules — determines the attempt as flawed) are thrown away, only leaving possible solved scenarios. Because each Slitherlink has one unique solution, this process ultimately results in one surviving attempt, which then is checked for correctness and printed out as the solution.
A list of Slitherlink rules can be found in this Wikipedia article.

Using the above described method, my solver takes roughly 𝟢.𝟢𝟧 seconds on an Intel Core i7 (𝟦.𝟢𝟢 GHz) to solve the example 𝟧 ⨉ 𝟧 Slitherlink. A 𝟣𝟢 ⨉ 𝟣𝟢 Slitherlink takes around 𝟣.𝟨 seconds whereas it takes 𝟥𝟤 seconds to solve a 𝟣𝟧 ⨉ 𝟣𝟧 Slitherlink. The non-polynomial time is clearly recognisable. [2]

My solver best runs in a bash shell [3], as it uses ANSI escape sequences to give the solved line a vivid blue and is entirely written in Python as well as fully text-based. The source code is listed below.

Other people also have written solvers, including puzzle generators, such as kakuro-online or appspot. The latter even supports different polygons as the Slitherlink base.

Source code: slitherlink-solver.py


  1. [2019-01-29] The link appears to be dead; I was able to find two mirrors: labri.fr and docplayer.net.
  2. [2020-07-28] Or rather, it becomes clear an inefficient algorithm — as in superlinear — is used.
  3. [2020-07-28] Really, I mean an ANSI color escape codes compatible terminal emulator.
Jonathan Frech's blog; built 2024/05/27 06:43:58 CEST