Pruning in UCT algorithm

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

Volumn , Issue , 2010, Pages 177-181

  Huang, Jing ^a   Liu, Zhiqing ^a   Lu, Benjie ^a   Xiao, Feng ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Monte Carlo planning; Pruning condition; Territorial information; UCT algorithm

Indexed keywords

COMPUTER GO; MARKOVIAN DECISION PROCESS; MONTE CARLO; MONTE-CARLO PLANNING; NEAR-OPTIMAL SOLUTIONS; ORIGINAL ALGORITHMS; PLANNING ALGORITHMS; PRUNING CONDITION; SOLUTION PATH; STATE SPACE; TERRITORIAL INFORMATION; UCT ALGORITHM;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

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

References (9)

1. Michael L. Littman, Thomas L. Leslie Pack Kaelbling. On the Complexity of Solving Markov Decision Problems. Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence(UAIC95):394-402, 1995.
2. F. James. Monte Carlo theory and practice. Reports on Progress in Physics, Vol.43, NO.9:1145-1189, 1980.
3. L. Kocsis and C. Szepesvari. Bandit based monte-carlo planning. The 15Th European Conference on Machine Learning(ECML), pages 282-293, 2006. (Pubitemid 44618839)
4. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2/3): 235-256, 2002. (Pubitemid 34126111)
5. Rémi Munos, Olivier Teytaud. Modification of UCT with Patterns in Monte-Carlo Go. Technical Report 60-62, INRIA, France, November 2006.
6. Sylvain Gelly, YizaoWang. Exploration exploitation in Go: UCT for Monte-Carlo Go. Twentieth Annual Conference on Neural Information Processing Systems(NIPS), 2006.
7. F. Van Lishout, G. Chaslot, and Jos W.H.M. Uiterwijkm. Monte-Carlo Tree Search in Backgammon. Computer Games Workshop:175-184, 2007.
8. Mark H. M. winands, Yngvi Björnsson and Jahn-Takeshi Saito. Monte-Carlo Tree Search Solver. Computer and Games: 25-36, September 2008.
9. F. de Mesmay, Arpad Rimmel, Yergen Voronenko, Markus Püschel. Bandit-based Optimization on Graphs with Application to Library Performance Turning. Proceedings of the 26th International Conference On Machine Learning:729-736, 2009.