• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2016 Fiscal Year Final Research Report

Large scale distributed monte-carlo game-tree search based on probability distribution

Research Project

  • PDF
Project/Area Number 26280130
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypePartial Multi-year Fund
Section一般
Research Field Entertainment and game informatics 1
Research InstitutionThe University of Tokyo

Principal Investigator

Yokoyama Daisaku  東京大学, 生産技術研究所, 助教 (80345272)

Co-Investigator(Renkei-kenkyūsha) TSURUOKA Yoshimasa  東京大学, 工学(系)研究科(研究院), 准教授 (50566362)
Project Period (FY) 2014-04-01 – 2017-03-31
Keywords人工知能 / アルゴリズム / ゲーム情報学
Outline of Final Research Achievements

Large-scale search problems in real world are not applicable exhaustive search; randomized search algorithms have great ability to explore such problems. Game tree search is an example of such problem; Monte-Carlo Tree Search algorithm (MCTS) has been developed and is getting widely used with good performance. This great advance, however, does not help to achieve good performance in Shogi that has long narrow path of 'correct' play.
We propose a new randomized game-tree search algorithm based on Bayesian Approach that can treat evaluated values as probability distributions. In this research we evaluate the effectiveness of our approach using distributed computing method.

Free Research Field

ゲーム情報学

URL: 

Published: 2018-03-22  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi