![]() ![]() However, even without knowing how to play perfectly, we can still prove that a perfect player cannot win every game. Despite having simple rules, perfect play is still very difficult to achieve. Minesweeper is a puzzle game where the objective is to find the hidden locations of mines, using the number of surrounding mines as clues. As an example for how to answer these types of questions, however, we may look at another game with heavy randomness: Minesweeper. However, in many respects, it is the more useful question to a player looking to maximize their own win rate, as it shows how close they are to playing optimally. ![]() Generally, there is no computationally feasible way to actually play optimally, so this question is very difficult to answer. The first question concerns the performance of a player that makes the theoretically optimal decisions at every point in the game to maximize its win rate, given the information available.
0 Comments
Leave a Reply. |