UCD: Upper confidence bound for rooted Directed Acyclic Graphs

Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010

Volumn , Issue , 2010, Pages 467-473

  Saffidine, Abdallah ^a   Cazenave, Tristan ^a   Méhat, Jean ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

DAG; Monte Carlo Tree Search; Transpositions; UCT

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH THEORY; MONTE CARLO METHODS; TREES (MATHEMATICS);

DIRECTED ACYCLIC GRAPH (DAG); EXPLORATION EXPLOITATIONS; MONTE CARLO TREE SEARCH (MCTS); MONTE-CARLO TREE SEARCHES; ON STATE; PARAMETERIZED; TRANSPOSITIONS; UPPER CONFIDENCE BOUND;

DIRECTED GRAPHS;

EID: 79951729216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAAI.2010.79     Document Type: Conference Paper

References (15)

1. R. Coulom, "Efficient selectivity and back-up operators in monte-carlo tree search," in Computers and Games 2006, ser. Volume 4630 of LNCS. Torino, Italy: Springer, 2006, pp. 72-83.
2. -, "Computing Elo ratings of move patterns in the game of Go," ICGA Journal, vol. 30, no. 4, pp. 198-208, December 2007. [Online]. Available: http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
3. S. Gelly and D. Silver, "Achieving master level play in 9 × 9 computer go," in AAAI, 2008, pp. 1537-1540.
4. G. Chaslot, L. Chatriot, C. Fiter, S. Gelly, J.-B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Combiner con-naissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC," Revue d'Intelligence Artificielle, vol. 23, no. 2-3, pp. 203-220, 2009.
5. T. Cazenave and A. Saffidine, "Utilisation de la recherche arborescente Monte-Carlo au Hex," Revue d'Intelligence Artificielle, vol. 23, no. 2-3, pp. 183-202, 2009.
6. D. Breuker, "Memory versus search in games," Universiteit Maastricht, PhD thesis, 1998.
7. B. E. Childs, J. H. Brodeur, and L. Kocsis, "Transpositions and move groups in monte carlo tree search," in CIG-08, 2008, pp. 389-395.
8. J. Méhat and T. Cazenave, "Combining UCT and nested Monte-Carlo search for single-player general game playing," to appear, 2010.
9. L. Kocsis and C. Szepesvàri, "Bandit based monte-carlo planning," in ECML, ser. Lecture Notes in Computer Science, vol. 4212. Springer, 2006, pp. 282-293. (Pubitemid 44618839)
10. T. Cazenave, "Nested monte-carlo search," in IJCAI, 2009, pp. 456-461.
11. C. Browne, Hex Strategy: Making the Right Connections, A. K. Peters, Ed. MA: Natick, 2000.
12. P. Henderson, B. Arneson, and R. B. Hayward, "Solving 8×8 Hex," in IJCAI, C. Boutilier, Ed., 2009, pp. 505-510.
13. A. Kishimoto and M. Müller, "A general solution to the graph history interaction problem," in AAAI, 2004, pp. 644-649.
14. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in ICML, 2007, pp. 273-280.
15. C. D. Rosin, "Multi-armed bandits with episode context," in Proceedings ISAIM, 2010.