Efficient sampling method for monte carlo tree search problem

Kazuki Teraoka, Kohei Hatano, Eiji Takimoto

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 estimated 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.

Original languageEnglish
Pages (from-to)392-398
Number of pages7
JournalIEICE Transactions on Information and Systems
VolumeE97-D
Issue number3
DOIs
Publication statusPublished - Jan 1 2014

Fingerprint

Sampling

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Efficient sampling method for monte carlo tree search problem. / Teraoka, Kazuki; Hatano, Kohei; Takimoto, Eiji.

In: IEICE Transactions on Information and Systems, Vol. E97-D, No. 3, 01.01.2014, p. 392-398.

Research output: Contribution to journalArticle

@article{1f857b13909c45f29350cc7427f68b45,
title = "Efficient sampling method for monte carlo tree search problem",
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 estimated 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.",
author = "Kazuki Teraoka and Kohei Hatano and Eiji Takimoto",
year = "2014",
month = "1",
day = "1",
doi = "10.1587/transinf.E97.D.392",
language = "English",
volume = "E97-D",
pages = "392--398",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - Efficient sampling method for monte carlo tree search problem

AU - Teraoka, Kazuki

AU - Hatano, Kohei

AU - Takimoto, Eiji

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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 estimated 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.

AB - 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 estimated 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.

UR - http://www.scopus.com/inward/record.url?scp=84897687316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897687316&partnerID=8YFLogxK

U2 - 10.1587/transinf.E97.D.392

DO - 10.1587/transinf.E97.D.392

M3 - Article

AN - SCOPUS:84897687316

VL - E97-D

SP - 392

EP - 398

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -