Linesweeper (Knight)

Question

Draw a single loop which does not intersect itself by connecting pairs of cells which share an edge. The loop may not pass through any clue cells. Numbers indicate how many of the cells which the clue can see¹ are passed through by the loop. (Question marks indicate any number is possible for that clue.)
¹ In the diagram below, all cells that the star can see are highlighted in green

The raw text csv file is available here. (If you can't access pastebin, it is also in the source code of the post – click edit or improve this post to find it.)

Rob Watts · Accepted Answer

Here's the path (in green):

My first step was to go through each one and mark (in orange) all the squares that could be seen by a zero. I marked the question mark and zero clues in red to help me keep track of which ones I'd taken care of already, and the non-zero clues in blue.

The next step was to mark in yellow the paths that were dead ends, and also labeled each path of an intersection with a letter so I could easily see which paths connected which intersections

To get from here to the end:

Linesweeper (Knight)

One Answer

Add your own answers!

Ask a Question