Keywords:Monte-Calro Tree Search
MCTS is a best-first search algorithm that gradually expands a search tree based on the results of random searches. One of its extensions is called "Tree Reuse". It stops repetitive searches by leaving a subtree from a child node that will be the root node next. However, it causes a problem in a non-deterministic environment where same choices give different results. It is often alleviated by attenuating the information the subtree has, but it is difficult to know in advance the attenuation level, called a decay factor, appropriate in the environment. Therefore, this work proposes a method automatically adjusting the decay factor using information obtained from the environment. Experiments using multiple game environments show that the proposal is better than the conventional Tree Reuse MCTS in the finish rate of the games.
Authentication for paper PDF access
A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.