Algorithm to solve Hisshi Problems and Endgames of Shogi
| Project/Area Number |
22700134
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Gunma University |
|---|
Principal Investigator |
NAGAI Ayumu 群馬大学, 大学院・工学研究科, 助教 (70375567)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2012: ¥260,000 (Direct Cost: ¥200,000、Indirect Cost: ¥60,000)
Fiscal Year 2011: ¥130,000 (Direct Cost: ¥100,000、Indirect Cost: ¥30,000)
Fiscal Year 2010: ¥130,000 (Direct Cost: ¥100,000、Indirect Cost: ¥30,000)
|
|---|
| Keywords | 将棋 / 必至問題 / アルゴリズム / 探索 / df-pn / 詰将棋 / 必至 |
|---|
| Research Abstract |
We solved many hard Hisshi Problems by a computer. While an algorithm to solve Tsume Shogi has greatly advanced, so far an algorithm to solve Hisshi has not advanced so much. We developed an algorithm based on df-pn+ which can solve hard Hisshi Problems. Experimental results on “Kitajyo Hisshi Problems" show that we solved79 problems out of 81. Besides, we found many different solutions.
|
Report
(4 results)
Research Products
(3 results)
