The Characteristics of the Card Game Daihinmin
Abstract
Combinatorial game theory has many ways of measuring game complexity. This study presents several measures of complexity for the card game Daihinmin to obtain some of its characteristics. Through computer experiments using programs playing Daihinmin, we collect data on the average number of possible moves and the average length of game in the case of the standard rules and in that of the rules including some local rules such as 11-Back. Then, we calculate some indicators such as the strategic complexity of the game and investigate the characteristics of these indicators. Furthermore, a questionnaire survey is conducted to find out which move a human will play from the initial hand in the specified situation. From moves made by various computer programs in the same situation, we show the difference in playing styles between humans and computers.
References
Daifugo – Wikipedia, https://en.wikipedia.org/wiki/Daifug%C5%8D.
The UEC Computer Daihinmin Convention. http://www.tnlab.inf.uec.ac.jp/daihinmin/. (in Japanese)
M. Konishi, S. Okubo, T. Nishino, and M. Wakatsuki, “Decision tree analysis in game informatics,” Studies in Computational Intelligence, “Applied Computing & Information Technology,” Springer International Publishing, vol.727, 2018, pp. 13-27.
M. Konishi, S. Okubo, T. Nishino, and M. Wakatsuki, “A decision tree analysis of a multi-player card game with imperfect information,” International Journal of Software Innovation, vol. 6, issue 3, 2018, pp. 1-17.
M. Minsky, “The Society of Mind,” New York: Simon and Schuster. ISBN 0-671-65713-5, 1988.
K. Ohto and T. Tanaka, “Supervised learning of policy function based on policy gradients and application to Monte Carlo simulations in Daihinmin,” IPSJ SIG Technical Report, vol. 2016-GI-35, no. 10, 2016, pp. 1-8. (in Japanese)
S. Okubo, T. Ayabe, and T. Nishino, “Feature extraction and cluster analysis using n-gram statistics for DAIHINMIN programs,” Studies in Computational Intelligence, “Applied Computing & Information Technology,” Springer International Publishing, vol. 619, 2016, pp. 27-41.
S. Okubo, T. Ayabe, and T. Nishino, “Cluster analysis using n-gram statistics for Daihinmin programs and performance evaluations,” International Journal of Software Innovation, vol. 4, issue 2, 2016, pp. 33-57.
S. Okubo, Y. Kado, Y. Takeuchi, M. Wakatsuki, and T. Nishino, “Toward a statistical characterization of computer Daihinmin,” International Journal of Software Innovation, vol. 7, issue 1, 2019, pp. 63-79.
S. Okubo, M. Wakatsuki, T. Mitsuishi, Y. Dobashi, and T. Nishino, “New applications of the Monte Carlo tree search to computer Daihinmin,” International Journal of Smart Computing and Artificial Intelligence, vol. 4, no. 1, 2020, pp. 18-35.
F. Suto, K. Narisawa, and A. Shinohara, “Development of client “Snowl” for computer Daihinmin convention,” Computer Daihinmin Symposium 2010, 2010. (in Japanese)
Y. Tajima and K. Tagashira, “Heuristics for Daihinmin and their effectiveness,” Studies in Computational Intelligence, “Applied Computing & Information Technology,” Springer International Publishing, vol. 619, 2016, pp. 59-69.
Y. Tajima, K. Tagashira, and G. Kikui, “Heuristics for Daihinmin and their effectiveness,” International Journal of Computer & Information Science, vol. 17, no. 2, 2016, pp. 7-14.
M. Wakatsuki, M. Fujimura, and T. Nishino, “A decision making method based on Society of Mind Theory in multi-player imperfect information games,” International Journal of Software Innovation, vol. 4, issue 2, 2016, pp. 58-70. DOI:10.4018/IJSI.2016040104.
M. Wakatsuki, Y. Dobashi, T. Mitsuishi, S. Okubo, and T. Nishino, “Strengthening methods of computer Daihinmin programs,” Proc. of 30th International Conference on Computer Applications in Industry and Engineering (CAINE 2017), San Diego, California, USA, 2017, pp. 229-236.
M. Wakatsuki, Y. Kado, Y. Takeuchi, S. Okubo, and T. Nishino, “What are the characteristics of the card game Daihinmin?,” Proc. of the 8th International Congress on Advanced Applied Informatics (IIAI AAI 2019), 2019, pp. 587-592.
