Convolutional Monte Carlo Rollouts in Go

12/10/2015
by   Peter H. Jin, et al.
0

In this work, we present a MCTS-based Go-playing program which uses convolutional networks in all parts. Our method performs MCTS in batches, explores the Monte Carlo search tree using Thompson sampling and a convolutional network, and evaluates convnet-based rollouts on the GPU. We achieve strong win rates against open source Go programs and attain competitive results against state of the art convolutional net-based Go-playing programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2014

Teaching Deep Convolutional Neural Networks to Play Go

Mastering the game of Go has remained a long standing challenge to the f...
research
06/13/2017

Beyond Monte Carlo Tree Search: Playing Go with Deep Alternative Neural Network and Long-Term Evaluation

Monte Carlo tree search (MCTS) is extremely popular in computer Go which...
research
05/31/2019

Multiple Policy Value Monte Carlo Tree Search

Many of the strongest game playing programs use a combination of Monte C...
research
02/16/2018

Monte Carlo Q-learning for General Game Playing

Recently, the interest in reinforcement learning in game playing has bee...
research
10/05/2021

Deep Synoptic Monte Carlo Planning in Reconnaissance Blind Chess

This paper introduces deep synoptic Monte Carlo planning (DSMCP) for lar...
research
03/14/2021

Monte Carlo Scene Search for 3D Scene Understanding

We explore how a general AI algorithm can be used for 3D scene understan...
research
12/14/2020

Learning to Stop: Dynamic Simulation Monte-Carlo Tree Search

Monte Carlo tree search (MCTS) has achieved state-of-the-art results in ...

Please sign up or login with your details

Forgot password? Click here to reset