14 search results - page 1 / 3 » Coherent Inference on Optimal Play in Game Trees |
JMLR
2010
12 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
ICGA
2007
13 years 4 months ago
2007
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
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...
AAAI
2006
13 years 6 months ago
2006
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 ...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...