The Reason for the Benefits of Minimax Search
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Search. Pages 322-326.
Abstract
Since there existed no convincing theoretical explanation for the usually observed benefits of minimax search in practice, we investigated two instances of a class of tree models which are based on the concept of quiescence. (This way the strict separation of static and dynamic aspects in practical programs is modeled.) We performed Monte Carlo simulations, enhanced by analytic results. The behaviour of these models in our studies generally corresponds quite well to observations in practice (especially that of the model based on the more restrictive definition of quiescence). Hence, we found empirical evidence for an earlier conjecture, and these results can serve as an important step towards understanding the reason for the benefits of minimax search .
@inproceedings{ijcai1989p51,
title = {The Reason for the Benefits of Minimax Search},
author = {Scheucher, Anton and Kaindl, Hermann},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {322--326},
year = {1989},
month = {8},
note = {Search},
url = {https://ijcai.org/proceedings/1989/51},
}
TY - CPAPER TI - The Reason for the Benefits of Minimax Search AU - Scheucher, Anton AU - Kaindl, Hermann T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 322 EP - 326 UR - https://ijcai.org/proceedings/1989/51 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
