Home Puzzle logical deduction – Filling in an 8×8 minesweeper grid with mines (Day 10: Double Neighbors)

logical deduction – Filling in an 8×8 minesweeper grid with mines (Day 10: Double Neighbors)

0
logical deduction – Filling in an 8×8 minesweeper grid with mines (Day 10: Double Neighbors)

[ad_1]

Previous Minesweeper puzzles

Based off of Day 10 of the Minesweeper Advent Calendar on heptaveegesimal.com

Difficulty (approximate): ★★★★☆

Contains: Single mines (1 mine), Anti-mines (-1 mines), Double mines (2 mines)


To get the $\color{green}✓$:

  1. Solve the 8×8 Minesweeper grid (the bonus puzzle is just for more practice)
  2. Show the steps used to fill in the grid.

So today, we have a pretty cool gimmick. What is the gimmick, you might ask? Today, the direct neighbors are counted twice, however the diagonal neighbors are counted once as always.

There are going to be no missing numbers from the actual puzzle since the actual puzzle is a really difficult puzzle on its own already.

An example:

Take this grid (contains only single mines) (Missing: 8x2, 9x1):

4
12
10
$\color{white}.$
5

Now, how is everything placed in this example? Here’s how:

  1. Note that mines that are orthogonal to a numbered cell are counted twice. Since there is only one way to add up to 4 and 5 using this info, we can place some single mines right away (m represents a single mine, x represents where a mine cannot go):
4 m
m x 12
10
m m $\color{white}.$
5 m
  1. There is also only one way to get 12:
4 m m m m
m x m 12 m
10 m m m
m m $\color{white}.$
5 m
  1. We can then deduce that there are mines at R3C1 and R4C3 because the total number of mines add up to 10 mines which is the only way to satisfy the 10 since we can’t have a mine at R2C2 which would make the 4 unsatisfiable, which means that 9 goes at R2C2:
4 m m m m
m 9 m 12 m
m 10 m m m
m m m $\color{white}.$
5 m
  1. Due to the gimmick, there is only one way to place mines to get 8 (3 orthogonal mines having a total value of 6 mines added to 2 diagonal mines to get a total of 8 mines) so we can fill in the rest of the grid to get the final unique solution:
4 m m m m
m 9 m 12 m
m 10 m m m
m m m m 8
5 m 8 m m

And that is the final and unique solution to our example grid.

Bonus example for more practice (not required for the green checkmark):

Contains: Single mine (1 mine), Double mines (2 mines)

Mine count: Single mine x13, Double mine x11

Missing numbers: N/A

8 12
13
7 13
18 12
10 9
6 11 7

The (actual) puzzle:

Contains:

+---------------+---+
|Single mine    |x10|
+---------------+---+
|Double mine    |x20|
+---------------+---+
|Anti mine      |x14|
+---------------+---+
|Missing numbers|x0 |
+---------------+---+
8 5 14
14 8
7 24
9 16 6
7 7
13 7 -11
-6 0
8 -2 -7

Hint:

There are anti-mines at R2C4 and R2C5

[ad_2]

Previous article Getting ready for VAT in 2015
Next article Ludology: Episode 21 – Innovation vs Reinterpretation
Hello there! My name is YoleeTeam, and I am thrilled to welcome you to AmazonianGames.com. As the premier destination for all things related to Amazon Games' universe, we are dedicated to providing you with the most exciting and immersive gaming experiences out there. From captivating visuals to exhilarating gameplay, our website is packed with comprehensive insights, updates, and reviews to keep you ahead of the game. Whether you're a seasoned gamer or new to the scene, I am here to guide you through this virtual frontier. If you have any questions or suggestions, feel free to reach out to me at john@yoleesolutions.com. Embark on your Amazon gaming journey today with AmazonianGames.com and let the adventure begin!