Logic Masters Deutschland e.V.

Minesweeper

(Eingestellt am 3. Februar 2022, 20:21 Uhr von 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

Lösungscode: Row 2


Gelöst von robals, Jesper, kublai, KnightedMatadox, Hardliner, ArchonE-mobile, zlotnleo, dreamfall, RyanMax, kolot, SenatorGronk, Palfly Kampling, fjam, teff, jadezki, yttrio, beavr, pandiani42, Hydalin, nicole1303, effervescentblizzard, Kenro, kp0hyc, lindae, AhmedK, logiq5, puzzeenjoyer, kukrksnik, novarielet, Shlefter, LibardiA, ibessonov, Kkirgb, Madoka42, annaswan, Duga, Boh, Vasefire, Luaryo
Komplette Liste

Kommentare

am 2. Dezember 2023, 01:37 Uhr von annaswan
This puzzle was beautiful! It was such a cool concept and executed really nicely. It flowed very well too.

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

am 18. August 2023, 10:34 Uhr von beavr
Very enjoyable puzzle :)

am 30. Juli 2023, 08:17 Uhr von 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

am 11. Februar 2022, 17:37 Uhr von kolot
Very enjoyable puzzle.

am 3. Februar 2022, 21:52 Uhr von Jesper
Thanks for correcting the puzzle. I was rather scratching my head yesterday, wondering if I was missing something.

am 3. Februar 2022, 21:41 Uhr von robals
Really enjoyed this one!

am 3. Februar 2022, 20:20 Uhr von Burning Curtains
An incorrect version of this puzzle was uploaded yesterday. This version is correct and only has 1 solution.

Schwierigkeit:3
Bewertung:98 %
Gelöst:39 mal
Beobachtet:4 mal
ID:000911

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden