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