Proceedings:
Book One
Volume
Issue:
Proceedings of the AAAI Conference on Artificial Intelligence, 3
Track:
Search
Downloads:
Abstract:
A theory of heuristic game tree search and evalua-tion functions for estimating minimax values is developed. The result is quite different from the tradi-tional minimax approach to game playing, and it leads to product-propagation rules for backing up values when subpositions in the game are independent. In this theory Nau’s paradox is avoided and deeper searching leads to better moves if one has reasonable evaluation functions.
AAAI
Proceedings of the AAAI Conference on Artificial Intelligence, 3