Computers have already eclipsed the level of human play in competitive Scrabble, but there remains room for improvement. In particular, there is much to be gained by incorporating...
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Opponent models are necessary in games where the game state is only partially known to the player, since the player must infer the state of the game based on the opponent’s acti...
Alan J. Lockett, Charles L. Chen, Risto Miikkulain...
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
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...