Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Incubator Q&A

Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.

Am unable to solve Minesweeper variant puzzle I created 6 months ago. Question

+0
−1

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.

$\color{red}{-1}$ $\color{green}{4}$ $\color{green}{-3}$
$\color{red}{-3}$ $\color{green}{-2}$ $\color{green}{1}$ $\color{blue}{7}$ $\color{green}{-2}$
$\color{green}{-3}$
$\color{green}{0}$ $\color{blue}{6}$ $\color{red}{0}$
$\color{green}{0}$ $\color{red}{-2}$
$\color{green}{-1}$ $\color{blue}{2}$ $\color{blue}{5}$ $\color{green}{3}$
$\color{green}{0}$ $\color{blue}{-3}$ $\color{green}{-2}$
$\color{green}{1}$ $\color{green}{2}$ $\color{green}{-1}$
History
Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

3 comment threads

Label rows/columns (2 comments)
Too many undefineds (2 comments)
So what's the question? (3 comments)

0 answers

Sign up to answer this question »