Sciweavers

2 search results - page 1 / 1
» Pruning Algorithms for Multi-Model Adversary Search
Sort
View
AI
1998
Springer
13 years 4 months ago
Pruning Algorithms for Multi-Model Adversary Search
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 prov...
David Carmel, Shaul Markovitch
AAAI
1996
13 years 5 months ago
Incorporating Opponent Models into Adversary Search
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
David Carmel, Shaul Markovitch