562 reputation
717
bio website soandos.wordpress.com
location Binghamton, NY
age 22
visits member for 2 years, 11 months
seen yesterday

Student.

Third to earn the marshal badge on SuperUser

profile for soandos on Stack Exchange, a network of free, community-driven Q&A sites

profile for soandos on Project Euler, which exists to encourage, challenge, and develop the skills and enjoyment of anyone with an interest in the fascinating world of mathematics.


Jun
2
asked count the number of subsets
Jun
1
comment Odds of winning at minesweeper with perfect play
@Joshua perfect play can mean making guesses. Thats the point of the question. What are the odds that you will win (not 1, as some guessing may be required)?
Jun
1
comment Odds of winning at minesweeper with perfect play
@Chris Eagle Agreed, I guess I was hasty. So the conclusion is that its basically impossible to figure out?
Jun
1
comment Odds of winning at minesweeper with perfect play
Thanks the kind of thing i was looking for.
Jun
1
comment Odds of winning at minesweeper with perfect play
So how many of those configurations can there be, and what are the odds of getting out of them is the question
Jun
1
comment Odds of winning at minesweeper with perfect play
If there is a square that cannot be solved, there it becomes and odds thing. If it can be solved and its just a matter of runtime i dont care about it. Reminds me a bit of the game of life.
Jun
1
comment Odds of winning at minesweeper with perfect play
My question is why though. (I do know what NP means, but it would seem to me (not that means a lot) that since one only has to consider a relatively constant number of blocks to advance, then as the grid gets bigger, this process has to be done more times. But not some power more, just linearly more)
Jun
1
comment Odds of winning at minesweeper with perfect play
Because the only thing that matters is how many unsolvable (need guessing) configurations are there with n mines in m space and what are the odds of solving them.
Jun
1
revised Odds of winning at minesweeper with perfect play
added 254 characters in body
Jun
1
comment Odds of winning at minesweeper with perfect play
And as a not so significant aside, people can do this pretty quickly with simple logic for a decently large sized board (expert) without making mistakes, so I am not sure what the author of the paper was talking about when he said all solvers are slow...
Jun
1
comment Odds of winning at minesweeper with perfect play
I am not looking for the best possible algorithm. I just want to know the odds of winning perfect play. Not how to win with the least total computation and the fanciest heuristics. It think it got sidetracked
Jun
1
comment Odds of winning at minesweeper with perfect play
That would seem to simplify the problem, not make it harder... Btw, the nine I was talking about are on the boundry, it would make zero sense to consider a 3x3 square.
Jun
1
comment Odds of winning at minesweeper with perfect play
1. It does (calculate this for all available squares. If none are zero, then guessing is a must anyway, and this way the program can pick the lowest) , and two, I just want to know the odds of it being beaten with perfect play.
Jun
1
revised Odds of winning at minesweeper with perfect play
added 447 characters in body; added 5 characters in body; added 13 characters in body
Jun
1
awarded  Editor
Jun
1
comment Odds of winning at minesweeper with perfect play
@DJC not a problem, every piece of input is appreciated.
Jun
1
revised Odds of winning at minesweeper with perfect play
added 483 characters in body
Jun
1
comment Odds of winning at minesweeper with perfect play
Its very interesting, but since I want to know a simpler piece of information (what are the odds, not what algorithm will get me those odds) is it possible?
Jun
1
asked Odds of winning at minesweeper with perfect play
May
29
comment Is there an equation to describe regular polygons?
If you can use rotation matrices then I would assume its possible...