A Research on General Purpose Fast Monte Carlo Tree Search
Project/Area Number |
23700158
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Intelligent informatics
|
Research Institution | Tokyo Institute of Technology (2012) The University of Tokyo (2011) |
Principal Investigator |
YOSHIZOE Kazuki 東京工業大学, 大学院・情報理工学研究科, 東工大特別研究員 (80449115)
|
Project Period (FY) |
2011 – 2012
|
Project Status |
Completed (Fiscal Year 2012)
|
Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2012: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2011: ¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
|
Keywords | 探索 / 論理 / 推論アルゴリズム / モンテカルロ法 / 囲碁 / 並列探索 / 探索アルゴリズム / 並列化 / 乱択アルゴリズム / 並列計算 / 人工知能 |
Research Abstract |
We have successfully parallelized the Monte-Carlo Tree Search algorithm which is known for its broad range of application. Our TDS-df-UCT algorithm achieved 3,200-fold speedup in the best case for synthesized game trees. Also, Accelerated UCT was invented to improve the speed of convergence for the cases existing algorithms fail to converge quickly. It was effective for several games. We have implemented a massively parallel Go program and a general purpose parallel search library on top of TDS-df-UCT.
|
Report
(3 results)
Research Products
(6 results)
-
-
[Presentation] Scalable Distributed Monte-Carlo Tree Search2011
Author(s)
Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto and Yutaka Ishikawa
Organizer
The Fourth Annual Symposium on Combinatorial Search (SoCS 2011)
URL
Place of Presentation
Barcelona, Spain
Year and Date
2011-07-15
Related Report
-
-
-
-