A Shogi Program Based on Monte-Carlo Tree Search
| Autor: | Daisuke Takahashi, Reijer Grimbergen, Yoshikuni Sato |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
business.industry
Computer science Monte Carlo tree search Computational Mechanics Machine learning computer.software_genre Computer Graphics and Computer-Aided Design Human-Computer Interaction Set (abstract data type) Tree (data structure) Computer Science (miscellaneous) Standard test Overall performance Artificial intelligence business Chess endgame Computer Go computer |
| Zdroj: | ICGA Journal. 33:80-92 |
| ISSN: | 2468-2438 1389-6911 |
| DOI: | 10.3233/icg-2010-33203 |
| Popis: | Recently, Monte-Carlo Tree Search (MCTS) has been attracting a great deal of attention in gameprogramming research. This method has been quite successful in computer Go, but so far results in other games have not been so impressive. In this paper, we present an implementation of MCTS in shogi which combines techniques used in computer Go with a number of shogi-specific enhancements. We tested this implementation on a standard test set of tactical positions. The number of correct answers indicates that the strength of the Monte-Carlo based shogi program is about that of a 1-dan amateur. The results did not carry over to actual playing strength as the match results against a conventional shogi program with a strength of about a 1-dan player showed. Therefore, it seems unlikely that a pure MCTS-based shogi program will surpass the level of the best conventional shogi programs. However, we also observed that our MCTS program could solve certain opening and endgame positions that are considered hard to solve with the current methods. Therefore, we believe that MCTS can be a useful method to improve the overall performance of a shogi program. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|