2026.09September 2026
Minedknight
A knight must cross this minefield from S, in the top-left corner, to F, in the bottom-right.
There are 17 mines shown in the configuration below. The knight does not know the configuration of these mines, only the total number and any numbers it has revealed.
When moving, the knight follows these rules:
- Each jump moves two squares in one direction and one square on the orthogonal axis. It cannot leave the board or revisit a square it has landed on.
- Landing in a cell reveals the number of mines in the eight neighboring squares, including diagonals. Revealing a zero also reveals all connected zeros and their bordering numbered squares. The shaded numbers show the initial reveal from S.
- The knight may jump only to a square that is certain is safe. That is to say, if it is at all possible that there will be a mine in a certain tile, the knight will not jump to it.
Number the visited squares from 1, starting at S. If is the number of adjacent mines at the square visited on step , find
Count both endpoints. Your submission should be the integer you receive.
bonus points if you know what the title is a reference to :)
# submissions are closed. the solution is below.
solution[show][hide]
The unique successful route visits 39 squares. Its adjacent-mine counts, in order, are:
0, 1, 2, 0, 1, 1, 2, 1, 1, 1, 2, 2, 0, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 0, 1, 3, 4, 1, 3, 3, 4, 0
Multiplying these by the step numbers 1 through 39 and adding gives .
Note that knowledge of the total mine count is essential at step 38. If that square contained a mine, the revealed clues would require at least 18 mines, but, since we know that the 17 mines exist in other positions, it must be safe.
Congratulations to anyone who didn't explode!
solved by0
no solves yet! be first 🩸?