inria-00117266, version 3
Modification of UCT with Patterns in Monte-Carlo Go
Sylvain Gelly
1Yizao Wang 1, 2Rémi Munos 2, 3Olivier Teytaud 1
N° RR-6062 (2006)
Abstract: Algorithm UCB1 for multi-armed bandit problem has already been extended to Algorithm UCT (Upper bound Confidence for Tree) which works for minimax tree search. We have developed a Monte-Carlo Go program, MoGo, which is the first computer Go program using UCT. We explain our modification of UCT for Go application and also the intelligent random simulation with patterns which has improved significantly the performance of MoGo. UCT combined with pruning techniques for large Go board is discussed, as well as parallelization of UCT. MoGo is now a top level Go program on $9\times9$ and $13\times13$ Go boards.
- 1: TAO (INRIA Futurs)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 2: Centre de Mathématiques Appliquées (CMAP)
- CNRS : UMR7641 – Université de Versailles Saint-Quentin-en-Yvelines – Polytechnique - X
- 3: SEQUEL (INRIA Futurs)
- INRIA – CNRS : UMR8022 – CNRS : UMR8146 – Université Lille 1 - Sciences et Technologies – Université Charles de Gaulle - Lille III – Ecole Centrale de Lille
- Domain : Computer Science/Artificial Intelligence
Computer Science/Learning - Internal note : RR-6062
- Available versions : v1 (2006-11-30) v2 (2006-12-12) v3 (2006-12-21)
- inria-00117266, version 3
- http://hal.inria.fr/inria-00117266
- oai:hal.inria.fr:inria-00117266
- From: Sylvain Gelly
- Submitted on: Wednesday, 20 December 2006 18:52:43
- Updated on: Thursday, 21 December 2006 09:49:17






Associated documents
Export