So 6 months ago, I posted this puzzle on Puzzling Stack Exchange that was part of my "Filling in an 8x8 minesweeper grid with mines" puzzle series. This specific one was based on Day 30 of the Minesweeper Advent Calendar on heptaveegesimal.com.

Currently, there are no answers on it, and since I have not kept track of the solution sheet, I find myself stuck trying to re-derive the solution.

Here's the concept of the puzzle:

Contains: Single mines (worth 1 mine), anti-mines (worth -1 mines)

• This is a torus puzzle. This means that a cell, for example R1C4 will be able to "see" mines at R1C3, R1C5, R2C3, R2C4, R2C5, R8C3, R8C4, R8C5 (if it were regular minesweeper)
• Also, each number has a specific color. There are two specific mechanics for the color:
  • Number: This tells you how many mines there are on the 4 orthogonal neighbors to a tile. For example, R1C4 will have orthogonal neighbors R1C3, R1C5, R2C4, R8C4
  • Color:

    Hint: A red 3 would indicate that there are 3 mines on the diagonal tiles and all orthogonal tiles are safe.

although I don't exactly remember anything else about it.

I know that if a number is blue, then it must be able to see all the tiles next to it (this rule can easily be deduced by noticing the 7), but the green is more confusing.

I think that it might be that all diagonal tiles are safe and that green numbers can only see cells that are orthogonal to them, but even if that is the case I'm not exactly sure how to solve it.

The puzzle:

_{Note: Had to change the 0 at R2C3 to a 1 to make sure that no contradictions arose, although that's the only mistake in the original puzzle I found. The reason it's a mistake is because if green cells only see mines orthogonal to them, then R2C3 can only have a minimum val. of 1.}

posted 7 months ago

CC BY-SA 4.0

CrSb0001‭

2 2 1