A Decision Tree Analysis of a Multi-Player Card Game With Imperfect Information
| Autor: | Masato Konishi, Mitsuo Wakatsuki, Tetsuro Nishino, Seiya Okubo |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer Networks and Communications
Computer science business.industry Decision tree Perfect information 020101 civil engineering 02 engineering and technology Computer Graphics and Computer-Aided Design 0201 civil engineering Computer Science Applications 020303 mechanical engineering & transports 0203 mechanical engineering Artificial Intelligence Artificial intelligence business Software |
| Zdroj: | International Journal of Software Innovation. 6:1-17 |
| ISSN: | 2166-7179 2166-7160 |
| DOI: | 10.4018/ijsi.2018070101 |
| Popis: | This article describes how computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using a player program. Because strong player programs of Computer Daihinmin use machine-learning techniques, such as the Monte Carlo method, predicting the program's behavior is difficult. In this article, the authors extract the features of the player program through decision tree analysis. The features of programs are extracted by generating decision trees based on three types of viewpoints. To show the validity of their method, computer experiments were conducted. The authors applied their method to three programs with relatively obvious behaviors, and they confirmed that the extracted features were correct by observing real behaviors of the programs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|