Tag Archives: algebraic linesweeper

Algebraic Linesweeper

[If you want to dive straight into Algebraic Linesweeper, here’s a printable PDF with rules.]

A friend of mine, Jak Marshall, created a pen-and-paper puzzle game called Linesweeper. Here are the rules:

  • Draw a single, closed, continuous loop in the empty cells of the grid which never crosses itself or branches.
  • The number clue in a cell indicates how many of the 8 adjacent cells are part of the loop (as in the classic computer game Minesweeper); for instance, a ‘0’ means that none of the adjacent cells are part of the loop.
  • The loop may not enter a cell with a number.
  • The loop may run horizontally or vertically (not diagonally) between centres of adjacent cells (that is, parallel to the grid lines).
  • The loop does not need to pass through all the unoccupied cells.
  • Each puzzle should have a unique solution.
Here’s an example, with its solution immediately below:
Linesweeper example
Linesweeper solved example
You can find this example and at least 20 more online Java puzzles at the German puzzle site janko.at. [Edit: Andrea Sabbatini has included Linesweeper (“the looping minesweeper”) into her 56 Logic Game Time Killers puzzle pack free for the iPhone and iPad. Linewsweeper works well on a touch screen.] Cross+A has even included Linesweeper in their commercial puzzle solver.

I think it’s fun and relaxing, and more satisfying to progress and finally connect the loop than fill in the final cells of a Sudoko puzzle. You can also design puzzles that use a bit of simple graph theory: if there is an area that your line visits with only three possible routes in and out, it can only use an even number (two) of these (the loop is in some sense a Eulerian circuit).

Algebraic Linesweeper

I’d like to introduce a variant of Linesweeper that I created. Instead of giving the number clues for a puzzle in a straightforward manner, I only give some letters that stand in for them. To be more specific:
  • Each letter corresponds to a unique number between 0 and 8.
  • Within a puzzle, different letters must correspond to different numbers.
  • Each puzzle should still have a unique solution!
I’ve made a handy one-page printable pdf file of six Algebraic Linesweeper puzzles, with the rules. The result, at first glance seems impossible. To convince you it is, and check that you’ve understood, here’re two tiny practice puzzles:
The “Elementary” puzzle illustrates the point I was making about Eulerian circuits above: you can view the puzzle as a more discrete version of the following diagram inspired by the Bridges of Königsberg.
Here’s the six actual puzzles from the above pdf in an approximate order of difficulty. Obviously, the choice of letters is slightly arbitrary, so I thought I would choose them based on some theme. If I can spell out words, like below, then it gives a convenient title to identify each puzzle:

1 Comment

Filed under Accessible, Puzzle