Logic Masters Deutschland e.V.

Mind the Edge ! #3

(Published on 20. September 2026, 14:26 by Todd)

Sudoku with digits 0–8: each row, column, and 3×3 box contains each of 0–8 exactly once. Do not use 9.

Each digit equals the total number of mines on that cell's four edges (top, bottom, left, right). Each edge holds 0, 1, or 2 mines; outer edges of the grid count too.

Pre-painted edges around given clues:
• blue = 0 mines
• red = 1 mine
• red with a red × = 2 mines

All outer-frame edge mines (the four borders of the grid) are given. Unpainted edges are not given — deduce and mark them. (Pen tool under Settings ⚙).

Online play: https://sudokupad.app/5ubd1vmoen

TIPS: This is a hybrid of Sudoku and Minesweeper. You need both Sudoku rules and the fact that adjacent digits share the mine count on their common edge. For example, an 8 forces 2 mines on each of its four edges, so none of its four neighbors can be 0 or 1. Likewise, none of the four neighbors of a 0 can be 7 or 8.The figure below shows one possible arrangement of digits in a box, together with mines on edges:

Mind the Edge ! 4x4: 000V0F.

Mind the Edge ! #1: 000UYM.

Mind the Edge ! #2: 000UZC.

Other interesting puzzles:

Magic 30: 000UVI.

7x7 clover sudoku 4: 000UMX.

More of my games: hitodd.com.

Solution code: The mine counts on all vertical edges of row 5, read left to right (10 numbers, each 0–2). Include both outer-border edges.

Last changed on on 21. September 2026, 10:28

Solved by raaaaa, Briks, Fizz, 72kchunshuai, WedgeOfCheese, kuliyuer , NEWS, kdwji, yangduoxing, fantasy8692, pmays123
Full list

Comments

on 21. September 2026, 00:34 by Todd
@Briks Thanks! I'll try to make a harder one.

Last changed on 21. September 2026, 00:33

on 21. September 2026, 00:32 by Todd
@Fizz Thank you very much for playing this whole series!

on 20. September 2026, 16:55 by Fizz
Tough break-in, got easier afterwards. Very fun overall, thanks!

on 20. September 2026, 16:10 by Briks
Very nice, but difficulty max 3 stars.

Difficulty:4
Rating:N/A
Solved:11 times
Observed:0 times
ID:000V0U

New Online solving tool

Enter solution

Solution code:

Login