Game graph structure and its influence on pathology
Almost all game tree search procedures used in artificial intelligence are variants on minimaxing. Until recently, it was almost universally believed that searching deeper on game trees with such procedures would in general yield a better decision. However, recent investigations show that there are many pathological game trees for which searching deeper consistently degrades the decision. This paper investigates one possible cause of pathology. In particular, a class of games that is normally pathological is shown to become nonpathological when the games are modified so that game positions can be reached by more than one path. This result suggests that in general, pathology is less likely when game positions can be reached by more than one path. This may be one reason why games such as chess and checkers are nonpathological. In addition, this result supports the hypothesis that pathology is less likely when sibling nodes have similar minimax values. This paper also investigates a possible cure for pathology-an alternative to minimaxing called probability estimation which has been shown to avoid pathology and thus produce more accurate decisions than minimaxing on at least one pathological game. 22 references.
- Research Organization:
- Univ. of Maryland, College Park
- OSTI ID:
- 5107738
- Journal Information:
- Int. J. Comput. Inf. Sci.; (United States), Vol. 6
- Country of Publication:
- United States
- Language:
- English
Similar Records
Search and heuristics
HackAttack: Game-Theoretic Analysis of Realistic Cyber Conflicts