| Budget Amount *help |
¥25,610,000 (Direct Cost: ¥19,700,000、Indirect Cost: ¥5,910,000)
Fiscal Year 2016: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2015: ¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2014: ¥6,630,000 (Direct Cost: ¥5,100,000、Indirect Cost: ¥1,530,000)
Fiscal Year 2013: ¥9,750,000 (Direct Cost: ¥7,500,000、Indirect Cost: ¥2,250,000)
|
|---|
| Outline of Final Research Achievements |
Graph Search problem aims at finding node(s) or path(s) from given graphs, which has various applications including path finding and combinatorial optimization. One of the interesting example is game AI. In the original research proposal, one of our goals was to develop a strong Go program for promoting the research results. However, as is well known, a strong Go program was developed by other research groups and we had focused on other goals, which is improving the performance of parallel search algorithms and applying to various problems. For depth-first search algorithms and hash-table based algorithms, we achieved promising results. Especially for depth-first search applications, we obtained a extremely efficient parallel algorithm for realistic problems.
|
