Speaking as someone who has spent WAY too much time playing minesweeper -- Early on I came to a similar conclusion (though without doing the actual math) and started clicking on corners initially. I soon discovered, as most people do, that corners are much more likely to expand out into a tiny opening that you can only follow for a short time before you're forced to make a "coin toss" move. If the goal is to make a _…
Speaking as the same sort of person (96 secs on expert :-) ), I agree that the most useful strategy is to click in the middle. This is because the cost of restarting is practically nothing for your first few clicks (no sunk time costs), so what you should really be optimizing is trying to get the most information about the board as soon as possible. All the more so because optimally your whole game will proceed logic…
Advanced Minesweeper
11–20 of 30 posts
Re: Advanced Minesweeper
#12Earlier quoted context omitted.
Speaking as the same sort of person (96 secs on expert :-) ), I agree that the most useful strategy is to click in the middle. This is because the cost of restarting is practically nothing for your first few clicks (no sunk time costs), so what you should really be optimizing is trying to get the most information about the board as soon as possible. All the more so because optimally your whole game will proceed logic…
Wouldn't bigger cascades be more likely to deadend, due to the average density of what's leftover increasing?
That is, you're trying to maximize information. A large rectangular area doesn't give you nearly as much information about the board as a tentacle-y one, because most of the squares don't tell you anything but their own value.
Re: Advanced Minesweeper
#13Speaking as someone who has spent WAY too much time playing minesweeper -- Early on I came to a similar conclusion (though without doing the actual math) and started clicking on corners initially. I soon discovered, as most people do, that corners are much more likely to expand out into a tiny opening that you can only follow for a short time before you're forced to make a "coin toss" move. If the goal is to make a _…
Re: Advanced Minesweeper
#14Speaking as someone who has spent WAY too much time playing minesweeper -- Early on I came to a similar conclusion (though without doing the actual math) and started clicking on corners initially. I soon discovered, as most people do, that corners are much more likely to expand out into a tiny opening that you can only follow for a short time before you're forced to make a "coin toss" move. If the goal is to make a _…
Do you think this is because the blob found in the middle is likely to have more perimeter squares than edge or corner selections?
I started out as a flagging user (the usual right-click to mark known mines), and then I always started in the lower right corner. Then (after a few years break) I started playing non-flagging (that is no right click allowed) and I find that a middle click is much more likely to give an "easy" opening.
My usual opening consists of several middle clicks spread out until I get an opening (or failure).
For every serious minesweeper I recommend the Minesweeper Clone: http://www.minesweeper.info/downloads/MinesweeperClone.html
(On one sad night I got 79 seconds on expert..)
Added: The cost (in seconds) of clicking corners until an opening is too high compared to the risk of getting a coin toss in a corner. Prudence isn't fast enough :)
Re: Advanced Minesweeper
#15Although I have no idea since I have never seen the code, I'm pretty sure there's no way to hit a bomb on your first click. I'm played enough (MS Windows) Minesweeper and have never, ever hit a bomb on the first click. As a side note, Minesweeper the first game I ever programmed was for my intro C class in college using SRGP[1] as the graphics library. Thinking back, it was a tough project. The Minesweeper logic wasn…
Re: Advanced Minesweeper
#16Earlier quoted context omitted.
Speaking as the same sort of person (96 secs on expert :-) ), I agree that the most useful strategy is to click in the middle. This is because the cost of restarting is practically nothing for your first few clicks (no sunk time costs), so what you should really be optimizing is trying to get the most information about the board as soon as possible. All the more so because optimally your whole game will proceed logic…
Wouldn't bigger cascades be more likely to deadend, due to the average density of what's leftover increasing?
Re: Advanced Minesweeper
#17There're some gems on DataGenetics' blog. Highly recommended.
Benford's Law http://www.datagenetics.com/blog/march52012/index.html
Hangman http://www.datagenetics.com/blog/april12012/index.html
Yahtzee http://www.datagenetics.com/blog/january42012/index.html
Risk http://www.datagenetics.com/blog/november22011/index.html
Plus others ...
Re: Advanced Minesweeper
#18Although I have no idea since I have never seen the code, I'm pretty sure there's no way to hit a bomb on your first click. I'm played enough (MS Windows) Minesweeper and have never, ever hit a bomb on the first click. As a side note, Minesweeper the first game I ever programmed was for my intro C class in college using SRGP[1] as the graphics library. Thinking back, it was a tough project. The Minesweeper logic wasn…
Re: Advanced Minesweeper
#19Although I have no idea since I have never seen the code, I'm pretty sure there's no way to hit a bomb on your first click. I'm played enough (MS Windows) Minesweeper and have never, ever hit a bomb on the first click. As a side note, Minesweeper the first game I ever programmed was for my intro C class in college using SRGP[1] as the graphics library. Thinking back, it was a tough project. The Minesweeper logic wasn…
As far as I can recall, hitting a bomb on the first click is possible. But, if the source code proves my memory wrong, it certainly wouldn't be the first time.
Re: Advanced Minesweeper
#20To make it more fair, calculate the probability that 3+ adjacent squares would be safe, since that's how many you get in the corner. Then the math shows that center is better because there are more neighboring squares that could be potentially blank.
More useful would be the probability of having a cascade continue on past adjacent squares to squares adjacent to those, with the "winner" being whichever location is most likely to make the largest exposed bubble.
My strategy is generally click a few places in the center quickly. If I die, I don't have much invested and just start over. If I find a large bubble, then I can play.