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

1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161
3 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
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.
Type de document :
Rapport
[Research Report] RR-6062, INRIA. 2006
Domaine :

https://hal.inria.fr/inria-00117266
Contributeur : Sylvain Gelly <>
Soumis le : mercredi 20 décembre 2006 - 18:52:43
Dernière modification le : jeudi 9 février 2017 - 15:16:25
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 14:03:55

### Fichier

RR-6062.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00117266, version 3

### Citation

Sylvain Gelly, Yizao Wang, Rémi Munos, Olivier Teytaud. Modiﬁcation of UCT with Patterns in Monte-Carlo Go. [Research Report] RR-6062, INRIA. 2006. <inria-00117266v3>

Consultations de
la notice

## 2743

Téléchargements du document