

We can go even further, and refine our answer to question 1, by asking how often a perfect player is expected to win. “Can a perfect player win every game?” No.To summarize, for Minesweeper, the answer to our two questions would be: Therefore, each seed is winnable by simply learning which squares do not contain mines. For Minesweeper, this means all the mines are in the same location each time you play a seed. Now, I’ve used the word seed twice, but what does it mean? In a computer game with randomness, a seed is a sequence of letters or numbers which determines all of the randomness in a playthrough.

Because such positions are guaranteed to arise in some seeds, not every game of Minesweeper can be won, even following an optimal strategy. For example, in the Minesweeper game below, the two remaining mines can either be in the squares marked “A” or the squares marked “B”, and a guess must be made.
Slay the spire seeds how to#
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. “For every seed of Slay the Spire, is there a sequence of decisions that results in a win?”.“Can a perfect player win every game of Slay the Spire?” (alternatively, “Is there a strategy that achieves a 100% win rate in Slay the Spire?”).Here are some more precise formulations of each question: Both are valid and interesting questions, and have very different answers. The two interpretations of the questionīefore we begin answering, first there is one detail to get straight: the question of whether every game can be won can actually be interpreted in two different ways. However, with such randomness comes a natural question: can every run of Slay the Spire be won? In this article, I will discuss what I believe to be the current state of knowledge about the answer to this question. This is part of the beauty of the game, forcing you to adapt and make the most out of the resources you have been given in each new attempt. From the cards and relics offered, to the potions dropped, to the map layouts and random encounters, very little remains the same between two playthroughs. There is a lot of randomness in a game of Slay the Spire.
