Search Procedures for Perfect Information Trees Containing Chance Nodes.

摘要

An extension of the alpha-beta tree pruning strategy to game trees with 'probability' nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '*-minimax' trees pertain to games involving chance but no concealed information. Casino blackjack, backgammon, some card games, and board games such as Monopoly are games of this type. An initial left-to-right depth-first algorithm is developed and shown to reduce the complexity of an exhaustive search strategy by 10 to 35 percent. An improved algorithm is then formulated for the class of 'regular' -minimax trees. With random ordering of successor nodes, this modified algorithm is shown to reduce search by more than 50 percent. With optimal ordering, it is shown to reduce search complexity by an order of magnitude. (Author)