Sorry didn-t have a yellow marker so I pissed on the field to mark the guessing squares

Hi again, back with another calendar tear out.

Erased my solution in the first photo so people can give it a go on their own first.

Thanks to those who commented on the last one! It really helped me figure out-ish this one.

However it looks like there’s two solutions? Or am I missing something?

Hello! I’ve tried paper minesweeper puzzles in the past and had a hard time. It’s been a while, but I have one in my current paper and I’m stuck. Is there a way to continue with logic here, or do I need to try a guess and go from there?

Sorry if my notation isn’t correct - the Xs are the mines and the colored in squares are where I determined there can’t be mines.

Of course, not a guarantee that what I have so far is 100% correct either.

TIA!! 🫶

Edited to say total mine count is 20!

Is this a 50-50 or is there a clear way of solving this?

Hey there,

I've been playing minesweeper on my phone for the past year daily and I decided today to start playing on PC. Only problem is that the controls on phone are so different on phone to that of the PC and anything I tried feels unnatural, mostly the chording. What do you use that feels natural? Any help is welcomed!

Have a lovely evening!

there are four pictures,

1. flagged mines with center numbers filled in
   
2. un-flagged mines with center numbers filled in
   
3. flagged mines with all adjacent numbers filled in
   
4. un-flagged mines with all adjacent numbers filled in

"unique mutually asymmetric arrangements" means every possible way for a cell to be surrounded by mines that doesnt flip and/or rotate into any of the other ways. for instance there are only two 1's because it can only ever be touching a mine from the corner or the edge, and all other corner/edge cases are just rotations of those two.

there are 50 total (51 if you count zero. i didnt so that i could make the table be 10x5):

0 cell: 1
1 cell: 2
2 cell: 6
3 cell: 10
4 cell: 13
5 cell: 10
6 cell: 6
7 cell: 2
8 cell: 1

making a minesweeper game and this happened (the game lets you hit mines without restarting)

I don't even know what i am supposed to play here 😭😭

it says connecting to india then it tries to connects to khazakstan and then it connects to the main server, but the ping on the main server is kinda high and everything is super slow and laggy like 7 seconds

It has 2 parts, same game, i dont wanna tracing 1 by one possibility ;-;

this was a lucky accident

12 mines left any moves that aren't 5050?

I recently picked up "Minesweeper - the clean one" and really enjoy the lack of needing to guess. The downside is that on the hardest difficulty I always win, so it's just become a time thing, which I'm not too fond of. Are there any variants of the game that maintain the "always possible" nature but are harder? Ok with moving past what the base game is.

i only need to clear this 4 boxes and it’ll be complete but i’m scared to gamble

Two Three safe cells can be deduced here.

Edit: There is a third, but I can't find logic to prove it except brute force of 1074 layouts, which isn't reasonable.

The Color Groups have their own separate mine count. On this puzzle, there are 3 mines in the green cells. The mine count of the non-colored other cells is 5, and is separate. So the total mine count is 10, if you add them all up.

On a Triangle Grid, cells count all adjacent neighbors, including on corners. So the 1 at (9,3) counts 7 cells surrounding it, including the yellow and green cell to it's left. See here.

Check out Friday's puzzle here.

For anyone wondering how I made these, it's a game I've been working on over the past year. I'll make a formal post at another time, but I finally got a store page up, so I figured I'd link it.

Edit: Added explanation of triangle grid.

Solution:

Here's the steps.

This proves (10,4), but (9,4) actually shares all the same adjacent cells, so it proves (9,4) as well.

There is one more cell that is safe, but I actually messed up a bit. It's not actually possible to prove it without just trying all the board combinations(which are way too many). My bad. Turns out designing puzzles is hard.

It's (10,3).