DocumentCode :
589267
Title :
Using Local Regression in Monte Carlo Tree Search
Author :
Randrianasolo, Arisoa S. ; Pyeatt, Larry D.
Volume :
1
fYear :
2012
fDate :
12-15 Dec. 2012
Firstpage :
500
Lastpage :
503
Abstract :
In this non-comparative study paper, local regression modeling is added to Monte Carlo Tree Search (MCTS). This local regression modeling is used to replace the random action selection in the simulation part of MCTS. The modified MCTS method and the regular MCTS method were tested against each other on the tic-tac-toe and the connect four games. The results of the experiment indicated that local regression helped the modified MCTS to outperform the regular MCTS on moderately memory demanding games, such as connect four. The performances of the two approaches appear to equal each other on low branching factor and less memory demanding games similar to tic-tac-toe.
Keywords :
Monte Carlo methods; computer games; learning (artificial intelligence); regression analysis; storage management; tree searching; Monte Carlo tree search; Q-learning; branching factor; connect four game; general game playing; local regression modeling; memory demanding game; modified MCTS method; random action selection; regular MCTS method; tic-tac-toe game; Computational modeling; Educational institutions; Games; Learning; Mathematical model; Monte Carlo methods; Regression tree analysis; General Game Playing; Local Regression; Monte Carlo Tree Search; Q-learning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Applications (ICMLA), 2012 11th International Conference on
Conference_Location :
Boca Raton, FL
Print_ISBN :
978-1-4673-4651-1
Type :
conf
DOI :
10.1109/ICMLA.2012.91
Filename :
6406673
Link To Document :
بازگشت