![]() ![]() 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. 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. ![]() Here are some more precise formulations of each question: Both are valid and interesting questions, and have very different answers. “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?”).“For every seed of Slay the Spire, is there a sequence of decisions that results in a win?”.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. Generally, there is no computationally feasible way to actually play optimally, so this question is very difficult to answer. ![]() 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. #SLAY THE SPIRE SEEDS ARE DIFFERENT HOW TO#Īs an example for how to answer these types of questions, however, we may look at another game with heavy randomness: Minesweeper. Minesweeper is a puzzle game where the objective is to find the hidden locations of mines, using the number of surrounding mines as clues.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |