Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Required fields*

A Somewhat Different Minesweeper

This is a type of Minesweeper puzzle I created, although I don't have a name for it yet. The rules are simple:

  1. All standard Minesweeper rules apply

  2. All cells with a 0, 1, or a 5 or higher are revealed.

  3. The gray flags (F) represent a mine which, if it was a clue, it would be a 1. The flags are looking at the surrounding 8 squares, they do not count themselves. All possible gray flags are shown.

  4. There are no mines with 0 or 4 or more mines surrounding it. That is, every mine can see at least 1 other mine, and no mine can see 4 or more other mines.

Minesweeper Puzzle

It's possible this puzzle will be easy. I'm still experimenting making these. Let me know what you think.

Answer*

Cancel
4
  • 2
    $\begingroup$ Could "All possible gray flags are shown." help narrow down where the last mines go? There cannot be any mines with one neighbouring mine, except for the given flagged mines. $\endgroup$ Commented Mar 6 at 17:13
  • 1
    $\begingroup$ From what I can tell, your solution is very close. Remember ALL cells with a 1 are shown and ALL possible grey flags are shown. $\endgroup$
    – Truej
    Commented Mar 6 at 17:20
  • 2
    $\begingroup$ @JaapScherphuis Thanks. Now I can complete the solution. $\endgroup$ Commented Mar 6 at 17:38
  • 1
    $\begingroup$ @Thanks. I completed the solution. $\endgroup$ Commented Mar 6 at 17:53