Can you solve this little minesweeper puzzle?
For those of you who don't know the minesweeper game, here are the rules:
You must find all the mines by reasoning about the numbers you see.
You can play minesweeper online or you can play my minesweeper remake.
Give it some thought!
If you need any clarification whatsoever, feel free to ask in the comment section below.
Congratulations to the ones that solved this problem correctly and, in particular, to the ones who sent me their correct solutions:
Join the list of solvers by emailing me your solution!
Let's look for the mines together!
This is the mine field we have to work with:
Let's look at the lower-left corner, at the
3 and the
3 has four neighbouring cells:
The two cells that have a double circle are next to the
and therefore we can't have mines in both of those cells.
Therefore, the two top circles must contain mines.
Two mines have been found!
3 that we were looking at now has two mines placed
next to it, so we only have to find the last one.
Regardless of where that mine is (one of the two double circles below),
it is always going to be next to the bottom-left
This means that there can be no mines between the two
on the bottom row.
By crossing out those two locations, we know that the bottom-right
1 has a mine right above it.
For the next step, we can look at the top-right
1 already has a neighbouring mine
(to the left, and down) which means all other neighbouring
cells must be empty.
In crossing out those positions,
we realise that the
3 on the second row, to the right,
only has one position left for its third mine.
Therefore, we can place a mine there.
As we place that mine, the puzzle is complete! Take a look for yourself:
Don't forget to subscribe to the newsletter to get bi-weekly problems sent straight to your inbox.
If you enjoyed this blog article, you will love the mathspp insider 🐍🚀 newsletter! Join +16.000 others who are taking their Python 🐍 skills to the next level! 🚀