inria-00117266, version 3

## Modiﬁcation of UCT with Patterns in Monte-Carlo Go

Sylvain Gelly () 1, Yizao Wang 12, Rémi Munos 23, Olivier Teytaud 1

N° RR-6062 (2006)

Résumé : 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 (UVSQ) – Polytechnique - X
• 3 :  SEQUEL (INRIA Futurs)
• INRIA – CNRS : UMR8146 – Université Lille I - Sciences et technologies – Université Lille III - Sciences humaines et sociales – Ecole Centrale de Lille

• inria-00117266, version 3
• oai:hal.inria.fr:inria-00117266
• Contributeur :
• Soumis le : Mercredi 20 Décembre 2006, 18:52:43
• Dernière modification le : Jeudi 21 Décembre 2006, 09:49:17