Asymmetric Move Selection Strategies in Monte-Carlo Tree Search: Minimizing the Simple Regret at Max Nodes

no code implementations • 8 May 2016 • Yun-Ching Liu, Yoshimasa Tsuruoka

We develop the Asymmetric-MCTS algorithm, which is an MCTS variant that applies a simple regret algorithm on max nodes, and the UCB algorithm on min nodes.

Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search

no code implementations • 11 May 2015 • Yun-Ching Liu, Yoshimasa Tsuruoka

The UCT algorithm, which combines the UCB algorithm and Monte-Carlo Tree Search (MCTS), is currently the most widely used variant of MCTS.