<journal article>
Efficient Sampling Method for Monte Carlo Tree Search Problem

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
Rights
Related DOI
Related URI
Relation
Abstract We consider Monte Carlo tree search problem, a variant of Min-Max tree search problem where the score of each leaf is the expectation of some Bernoulli variables and not explicitly given but can be es...timated through (random) playouts. The goal of this problem is, given a game tree and an oracle that returns an outcome of a playout, to find a child node of the root which attains an approximate min-max score. This problem arises in two player games such as computer Go. We propose a simple and efficient algorithm for Monte Carlo tree search problem.show more

Hide fulltext details.

pdf ieice14 pdf 441 KB 280  

Details

Record ID
Peer-Reviewed
Subject Terms
ISSN
eISSN
DOI
NCID
Notes
Created Date 2015.12.03
Modified Date 2015.12.04

People who viewed this item also viewed