A Theory of Game Trees
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 minimsx 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. I
Cite
Text
Tzeng and Jr.. "A Theory of Game Trees." AAAI Conference on Artificial Intelligence, 1983.Markdown
[Tzeng and Jr.. "A Theory of Game Trees." AAAI Conference on Artificial Intelligence, 1983.](https://mlanthology.org/aaai/1983/tzeng1983aaai-theory/)BibTeX
@inproceedings{tzeng1983aaai-theory,
title = {{A Theory of Game Trees}},
author = {Tzeng, Chun-Hung and Jr., Paul Walton Purdom},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1983},
pages = {416-419},
url = {https://mlanthology.org/aaai/1983/tzeng1983aaai-theory/}
}