Estimation of minimax values
Chun-Hung Tzeng, Paul Walton Purdom · 1986
In estimating minimax values, an important topic in the study of heuristic game tree searches, a pathological phenomenon sometimes results when the conventional minimax procedure is used as a back-up process. In this paper exact methods are derived for two different games, one using product-propagation rules as a back-up process and another not using any back-up process. The method of estimating minimax values in a heuristic game tree search should depend on both the static evaluation function and the structure of the game tree; it can be very different for different games.