Minesweeper, with no loop over cells.

The game you already know how to play. What is worth a look is underneath: the whole board's adjacent-mine count is one indexed sum, and opening an empty region is a converge: keep adding the neighbours of revealed empty cells until the set stops growing. No recursion, no queue, no loop over cells anywhere. The entire game is at the bottom of this page.

starting the engine…

seed

Left click opens a cell · right click plants a flag · clicking a number that already has enough flags around it opens the rest. The first click is always safe, and always lands in open space.

Board

mines left: 10
time: 0.0s
state: ready

How it works

NI holds, for each of the eight directions, the index of that neighbour for every cell at once. NV says whether that neighbour is on the board, which is what replaces the usual bounds check.

So the adjacent-mine count for the entire board is cnt: +/NV*mn@NI. Index the mine vector by all eight neighbour vectors, mask off the edges, and sum.

Opening an empty region is {x|(|/NV*(x&cnt=0)@NI)}/rv: add the neighbours of every revealed empty cell, and repeat until nothing changes. f/x is convergence, so it stops on its own when the set stops growing.

The mines are dealt with -M?#ok, a deal rather than a roll, because M?n would repeat and quietly give you fewer mines than advertised.

Same seed, same board

The mines come from the seed, so a board can be replayed or handed to someone else. They are dealt after your first click, around it, which is how the opening move is guaranteed safe.

The whole game: assets/sweep/sweep.k

loading…