| TR#: | CIS9607 |
| Class: | CIS |
| Title: | Incorporating Opponent Models into Adversary Search |
| Authors: | David Carmel and Shaul Markovitch |
| CIS9607.pdf | |
| Abstract: | 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 that uses an arbitrary opponent model to simulate the opponent's search. The opponent model is a recursive structure consisting of the opponent's evaluation function and its model of the player. We demonstrate experimentally the potential benefit of using an opponent model. Pruning in M* is impossible in the general case. We prove a sufficient condition for pruning and present the M* algorithm which returns the M* value of a tree while searching only necessary branches. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1996/CIS/CIS9607), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 1996
To the main CS technical reports page