Abstract
Recent works on the MCTS and UCT framework in the domain of Go focused on introducing knowledge to the playout and on pruning variations from the tree, but so far node expansion has not been investigated. In this paper we show that delaying expansion according to the number of the siblings delivers a gain of more than 92% when compared to normal expansion. We propose three improvements; one that uses domain knowledge and two that are domain-independent methods. Experimental results show that all advanced operators significantly improve the UCT performance when compared to the basic delaying expansion. From the results we may conclude that the new expansion operators are an appropriate means to improve the UCT algorithm. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Yajima, T., Hashimoto, T., Matsui, T., Hashimoto, J., & Spoerer, K. (2011). Node-expansion operators for the UCT algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6515 LNCS, pp. 116–123). https://doi.org/10.1007/978-3-642-17928-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
