Logic Masters Deutschland e.V.

Japanese Minesweeper (Expert)

(Published on 4. April 2026, 00:00 by cyddrdrd)

Hi Minehunter,

Minesweeper is back! Your goal is to find all the hidden mines in the grid. This time, however, all clues are given as Japanese sums outside the grid, so no numbers inside the cells are given!

Just like classic Minesweeper, I prepared three levels for you:

Beginner (9x9, 10 mines)
Intermediate (16x16, 40 mines)
Expert (16x30, 99 mines)

Finally, here you are, the Expert. While this is the largest one, don't be intimidated. You've already made it through the Intermediate, haven't you? Bring your calculator and have fun!
Oh, what's that? You are too lazy to use it? Then come a little closer… I'll whisper a secret: the sum of all column clues is 776 + ??.

Rules

  1. Classic Minesweeper: There are some mines in the grid. Every clued cell (i.e., a non-mine cell that is orthogonally or diagonally adjacent to at least one mine) contains a digit equal to the number of adjacent mines. Cells not adjacent to any mine are left empty.

  2. Japanese Sums: Clues outside the grid represent the sum of digits in each contiguous sequence of clued cells, in the order of appearance from left to right or top to bottom. Consecutive sequences must be separated by at least one mine cell or one empty cell.
    A '?' represents any digit from 0 to 9. For a double-digit number, its first digit cannot be 0.
Thank you MonsieurTRISTE for testing and suggestions!



Main puzzle (16x30, 99 mines):

Penpa+ (solution check on mines)
SudokuPad (no solution check)



Example puzzle (6x6, 5 mines):
It is highly recommended to try the example first to get familiar with the ruleset.

Penpa+ (example)
SudokuPad (example)


Solution code: From top to bottom, the number of mines in each row. For the example puzzle, it would be 110021

Last changed on on 10. April 2026, 13:30

Solved by MonsieurTRISTE, nuzzopa, SPring, JustinTucker
Full list

Difficulty:5
Rating:N/A
Solved:4 times
Observed:1 times
ID:000RYN

Puzzle combination Large

Enter solution

Solution code:

Login