no code implementations • 21 Nov 2023 • Edgar Galvan, Fred Valdez Ameneyro
A selection policy that works particularly well in MCTS is the Upper Confidence Bounds for Trees, referred to as UCT.
no code implementations • 7 Feb 2023 • Fred Valdez Ameneyro, Edgar Galvan
A particular selection policy that works particularly well, widely adopted in MCTS, is the Upper Confidence Bounds for Trees, referred to as UCT.
no code implementations • 29 Aug 2022 • Edgar Galván, Gavin Simpson, Fred Valdez Ameneyro
In this work, we use Evolutionary Algorithms (EAs) to evolve mathematical expressions with the goal to substitute the UCT formula and use the evolved expressions in MCTS.
no code implementations • 27 Sep 2020 • Fred Valdez Ameneyro, Edgar Galvan, Anger Fernando Kuri Morales
Monte Carlo Tree Search (MCTS) is a relatively new sampling method with multiple variants in the literature.
no code implementations • 30 Aug 2020 • Edgar Galván, Oxana Gorshkova, Peter Mooney, Fred Valdez Ameneyro, Erik Cuevas
Furthermore, we tackle the former limitation by employing a mechanism that allows us to seed part of the population using Monte Carlo Tree Search, a method that has dominated multiple General Video Game AI competitions.