![]() ![]() It does not store any personal data.Conceding that Iâm not going to be the fastest or best gamer, I instead chose to exercise my programming skills. The cookie is set by the GDPR Cookie Consent plugin and is used to store whether or not user has consented to the use of cookies. The cookie is used to store the user consent for the cookies in the category "Performance". This cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Other. The cookies is used to store the user consent for the cookies in the category "Necessary". The cookie is set by GDPR cookie consent to record the user consent for the cookies in the category "Functional". The cookie is used to store the user consent for the cookies in the category "Analytics". These cookies ensure basic functionalities and security features of the website, anonymously. Necessary cookies are absolutely essential for the website to function properly. After a little research I found a post where someone had done the math stating that if board size and number of bombs scaled at the same ratio, once you get into the higher thousands in board size, the winrate of a perfect game would never be higher than 5% just due to the sheer amount of guessing required in such a large board. On a board thousands of tiles wide, if the last tile you had to pick was a 50/50 random chance, then you never really had higher than a 50/50 chance to begin with. ![]() What I mean by that is, even if a human or a computer plays the game 100% perfectly and uses every possible logical scenario, more often than not it will eventually be forced to guess. The most interesting observation to come out of this project was the realization that almost every game of minesweeper is almost completely decided by chance. But there are too many logical cases to program in one day. ![]() The outcome will be one tile being selected and the other flagged. Therefore these two tiles are now linked and the algorithm will run again using this new information. With this we know that between those last two unflagged squares, there must be exactly one bomb. We know from the two flags already touching it. If you look at the 3, we know there are two unflagged squares touching it. With the current two steps in place, no progress can be made here. Therefore one more search is in order before the algorithm chooses a random tile. This is not a good system and frequently results in a loss. If the board can’t make any more progress it will randomly select one from the tiles left. With just these two steps in place the algorithm is at about a 70-80% winrate. For example, we know these green squares are safe and can be selected. So essentially this is to make progress on the board by clicking on squares that are certainly not bombs and therefore receiving more information.
0 Comments
Leave a Reply. |