Probabilistic Opponent-Model Search in Bao


In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types ω0 . . . ωN−1. The opponent is assumed to adopt at every move one of the opponent types ωi according to the probability Pr(ωi). We hypothesize that PrOM search is a better search mechanism than Opponent-Model search (OM search) and Minimax… (More)
DOI: 10.1007/978-3-540-28643-1_53


5 Figures and Tables

Cite this paper

@inproceedings{Donkers2004ProbabilisticOS, title={Probabilistic Opponent-Model Search in Bao}, author={H. H. L. M. Donkers and H. Jaap van den Herik and Jos W. H. M. Uiterwijk}, booktitle={ICEC}, year={2004} }