Towards Understanding the Effects of Evolving the MCTS UCT Selection Policy

02/07/2023
by   Fred Valdez Ameneyro, et al.
0

Monte Carlo Tree Search (MCTS) is a sampling best-first method to search for optimal decisions. The success of MCTS depends heavily on how the MCTS statistical tree is built and the selection policy plays a fundamental role in this. A particular selection policy that works particularly well, widely adopted in MCTS, is the Upper Confidence Bounds for Trees, referred to as UCT. Other more sophisticated bounds have been proposed by the community with the goal to improve MCTS performance on particular problems. Thus, it is evident that while the MCTS UCT behaves generally well, some variants might behave better. As a result of this, multiple works have been proposed to evolve a selection policy to be used in MCTS. Although all these works are inspiring, none of them have carried out an in-depth analysis shedding light under what circumstances an evolved alternative of MCTS UCT might be beneficial in MCTS due to focusing on a single type of problem. In sharp contrast to this, in this work we use five functions of different nature, going from a unimodal function, covering multimodal functions to deceptive functions. We demonstrate how the evolution of the MCTS UCT might be beneficial in multimodal and deceptive scenarios, whereas the MCTS UCT is robust in unimodal scenarios and competitive in the rest of the scenarios used in this study.

READ FULL TEXT
research
12/17/2021

On the Evolution of the MCTS Upper Confidence Bounds for Trees by Means of Evolutionary Algorithms in the Game of Carcassonne

Monte Carlo Tree Search (MCTS) is a sampling best-first method to search...
research
08/29/2022

Evolving the MCTS Upper Confidence Bounds for Trees Using a Semantic-inspired Evolutionary Algorithm in the Game of Carcassonne

Monte Carlo Tree Search (MCTS) is a sampling best-first method to search...
research
01/30/2019

Learning Position Evaluation Functions Used in Monte Carlo Softmax Search

This paper makes two proposals for Monte Carlo Softmax Search, which is ...
research
11/27/2018

Single-Agent Policy Tree Search With Guarantees

We introduce two novel tree search algorithms that use a policy to guide...
research
11/19/2018

Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification

Monte Carlo tree search (MCTS) has received considerable interest due to...
research
08/09/2014

Selecting Computations: Theory and Applications

Sequential decision problems are often approximately solvable by simulat...
research
04/13/2021

Deep imagination is a close to optimal policy for planning in large decision trees under limited resources

Many decisions involve choosing an uncertain course of actions in deep a...

Please sign up or login with your details

Forgot password? Click here to reset