Academic Commons

Reports

A Cure for Pathological Behavior in Games That Use Minimax

Abramson, Bruce

Minimax has long been the standard method of evaluating game tree nodes in game-playing programs. The general assumption underlying these programs is that deepening search improves play. Recent work has shown that this assumption is not always valid; for a large class of games and evaluation functions, deepening search decreases the probability of making a correct more. This phenomena is called game tree pathology. Two structural properties of game trees have been suggested as causes of pathology: independence among the values of sibling nodes, and uniform depth of win nodes. This paper examines the relationship between uniform in depth and pathology. A game-playing program is run using two different evaluation functions. The first recognizes wins only at the bottom level, the second at various levels throughout the tree. The minimax procedure behaves pathologically when the first function is used; the second shows no such pathology. This result constitutes the first experimental evidence linking uniform win depth to pathology. The effect of not recognizing wins until the bottom of the tree on the probability of making a correct decision is also analyzed. This analysis may lead to a general characterization of pathology in terms of win distribution.

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-153-85
Published Here
October 31, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.