inria-00544758, version 1
Intelligent Agents for the Game of Go
IEEE Computational Intelligence Magazine (2010)
Résumé : Monte-Carlo Tree Search (MCTS) is a very efficient recent technology for games and planning, par- ticularly in the high-dimensional case, when the number of time steps is moderate and when there is no natural evaluation function. Surprisingly, MCTS makes very little use of learning. In this paper, we present four techniques (ontologies, Bernstein races, Contextual Monte-Carlo and poolRave) for learning agents in Monte-Carlo Tree Search, and experiment them in difficult games and in particular, the game of Go.
- a – Dept. of Computer Science and Information Engineering
- 1 :
- CNRS : UMR8623 – Université Paris XI - Paris Sud
- 2 :
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 3 :
- National University of Tainan
- 4 :
- National University of Tainan
- Domaine : Informatique/Informatique et théorie des jeux
- Versions disponibles : v1 (10-12-2010) v2 (14-04-2011)
- inria-00544758, version 1
- http://hal.inria.fr/inria-00544758
- oai:hal.inria.fr:inria-00544758
- Contributeur :
- Soumis le : Mercredi 8 Décembre 2010, 21:24:31
- Dernière modification le : Vendredi 10 Décembre 2010, 11:08:58




Documents associés
Exporter