Logic Masters Deutschland e.V.

Minesweeper

(Published on 3. February 2022, 20:21 by Burning Curtains)

Normal Sudoku Rules Apply. Each row, column, and box contains the digits 0-8 once each.

There are mines scattered around the grid for you to find.
The value of each non-mine cell is equal to the number of mines it is adjacent to (both diagonally and orthogonally).

Diamond cells are NOT mines.
Circles indicate the number mines adjacent to the circle.
The blue cage (read as a 2 digit number) indicates the total number of mines in the grid.

CTC

Solution code: Row 2


Solved by robals, Jesper, kublai, KnightedMatadox, Hardliner, ArchonE-mobile, zlotnleo, dreamfall, RyanMax, kolot, SenatorGronk, Palfly Kampling, fjam, teff, jadezki, yttrio, beavr, pandiani42, Hydalin, ... kukrksnik, novarielet, Shlefter, LibardiA, ibessonov, Kkirgb, Madoka42, annaswan, Duga, Boh, Vasefire, Luaryo, puzzlegaming-098, bielaczek, Zuka, hildende, jimmy_bob, Chrisccx, zrbakhtiar, coolguy14
Full list

Comments

on 2. December 2023, 01:37 by annaswan
This puzzle was beautiful! It was such a cool concept and executed really nicely. It flowed very well too.

on 11. October 2023, 00:10 by Kkirgb
Lovely "little" puzzle, took about 55 minutes because I am a slow solver but overall would recommend for beginners.

on 18. August 2023, 10:34 by beavr
Very enjoyable puzzle :)

on 30. July 2023, 08:17 by KyleBaran
I got to the end and ended up with a deadly pattern ... then I realized I made a mistake in the central box very early on and wasted nearly an hour.
Still a very fun concept and I look forward to redoing it again

on 11. February 2022, 17:37 by kolot
Very enjoyable puzzle.

on 3. February 2022, 21:52 by Jesper
Thanks for correcting the puzzle. I was rather scratching my head yesterday, wondering if I was missing something.

on 3. February 2022, 21:41 by robals
Really enjoyed this one!

on 3. February 2022, 20:20 by Burning Curtains
An incorrect version of this puzzle was uploaded yesterday. This version is correct and only has 1 solution.

Difficulty:3
Rating:99 %
Solved:47 times
Observed:5 times
ID:000911

Puzzle variant

Enter solution

Solution code:

Login