![]() This means that our program will always win in at most 49 moves when playing white (the first player). The game-theoretic value of the starting position is win in 49 moves. We calculated the strong solution of Morabaraba (which was previously unsolved). Peter Stahlhacke calculated a strong solution for the Lasker variant. Ralph Gasser calculated a strong solution for the moving phase of the standard Nine Men’s Morris, and established the game-theoretic value of the game to be a draw. This way the program never makes a mistake: it will always reach the best possible result from any game state. A game-playing program can use this database at every move by looking ahead one move, and maximizing the game-theoretic value of the state (from its perspective) after its move. The standard method for strongly solving games is to calculate a database containing the game-theoretic values of all the game states. In our research, we examined the positions that can be obtained from the usual starting position by modifying the number of pieces to be placed by the players. This can provide further insight into the game. Extended strong solution: We define this as a strong solution for an extended state space, namely, for all the positions reachable from a set of alternative starting positions.Ultra-strongly solved: a strategy is known which increases our chances to achieve more than the game-theoretic value when faced with a fallible opponent (i.e.This has the effect that it can play perfectly even if mistakes were made on one or both sides. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |