Monte-Carlo Graph Search for AlphaZero

12/20/2020
by   Johannes Czech, et al.
121

The AlphaZero algorithm has been successfully applied in a range of discrete domains, most notably board games. It utilizes a neural network, that learns a value and policy function to guide the exploration in a Monte-Carlo Tree Search. Although many search improvements have been proposed for Monte-Carlo Tree Search in the past, most of them refer to an older variant of the Upper Confidence bounds for Trees algorithm that does not use a policy for planning. We introduce a new, improved search algorithm for AlphaZero which generalizes the search tree to a directed acyclic graph. This enables information flow across different subtrees and greatly reduces memory consumption. Along with Monte-Carlo Graph Search, we propose a number of further extensions, such as the inclusion of Epsilon-greedy exploration, a revised terminal solver and the integration of domain knowledge as constraints. In our evaluations, we use the CrazyAra engine on chess and crazyhouse as examples to show that these changes bring significant improvements to AlphaZero.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2023

Proof Number Based Monte-Carlo Tree Search

This paper proposes a new game search algorithm, PN-MCTS, that combines ...
research
05/11/2015

Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search

The UCT algorithm, which combines the UCB algorithm and Monte-Carlo Tree...
research
04/30/2023

Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search

Graph neural networks are useful for learning problems, as well as for c...
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
10/15/2019

Approximate Inference in Discrete Distributions with Monte Carlo Tree Search and Value Functions

A plethora of problems in AI, engineering and the sciences are naturally...
research
11/22/2022

Monte Carlo Forest Search: UNSAT Solver Synthesis via Reinforcement learning

We introduce Monte Carlo Forest Search (MCFS), an offline algorithm for ...
research
12/03/2013

Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification

In many applications of computer algebra large expressions must be simpl...

Please sign up or login with your details

Forgot password? Click here to reset