.png){kind=icon}
.png){kind=icon}
Return
Pruning algorithms for multi-model adversary search
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(97)00074-X.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prove a sufficient condition that enables pruning and describe two pruning algorithms, alpha beta* and alpha beta(1p)* We prove correctness and optimality of the algorithms and provide an experimental study of their pruning power. We show that for opponent models that are not radically different from the player's strategy, the pruning power of these algorithms is significant. (C) 1998 Elsevier Science B.V.
Keywords:
opponent modeling
adversary search
pruning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available