![]() ![]() The resulting proof gives an optimal strategy for every possible position on the board. īy contrast, "strong" proofs often proceed by brute force-using a computer to exhaustively search a game tree to figure out what would happen if perfect play were realized. "Ultra-weak" proofs require a scholar to reason about the abstract properties of the game, and show how these properties lead to certain outcomes if perfect play is realized. Strong solution Provide an algorithm that can produce perfect moves from any position, even if mistakes have already been made on one or both sides.ĭespite their name, many game theorists believe that "ultra-weak" proofs are the deepest, most interesting and valuable. Weak solution Provide an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game. ![]() This can be a non-constructive proof (possibly involving a strategy-stealing argument) that need not actually determine any moves of the perfect play. Solving such a game may use combinatorial game theory and/or computer assistance.Ī two-player game can be solved on several levels: Ultra-weak solution Prove whether the first player will win, lose or draw from the initial position, given perfect play on both sides. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance Game whose outcome can be correctly predictedĪ solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |