So the other day I was once again on Minesweeper, just doing my duty and trying not to explode.
I had the thought:
What is the most amount of mines possible on a logically solvable puzzle?
For arguments sake the board size I was playing on was 20x35 tiles so a solution this size is good!
What possible patterns can determine whether it's solvable, and is there someway to apply this to any size of board?
Any single solution would be appreciated but some formulas or something would be better.
The only rule (other than the games rules) is that you can pick where ever to start, as usually you would randomly try tiles until you find a workable area anyway.
If you don't know what Minesweeper is then that very much saddens me.
But here: Wikipedia-MinesweeperVideoGame, do find out!
I assumed this was part of the rules.
However it may not be so I am going to include it in the question:
Each mine must have at least one number marking it.
Also the board must be logically solvable, so no need to guess once given the starting tile.
Sorry for not clarifying these at the start.