Abstract
Monte-Carlo Tree Search is a powerful paradigm for deterministic perfect-information games. We present various changes applied to this algorithm to deal with the stochastic game Chinese Dark Chess. We experimented with group nodes and chance nodes using various configurations: with different playout policies, with different playout lengths, with true or estimated wins. Results show that extending playout length over the real draw condition is beneficial to group nodes and to chance nodes. It also shows that using an evaluation function can reduce the number of draw games with group nodes and can be increased with chance nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, B.-N., Shen, B.-J., Hsu, T.-S.: Chinese Dark Chess. ICGA Journal 33(2), 93–106 (2010)
Chen, J.-C., Lin, T.-Y., Hsu, S.-C., Hsu, T.-S.: Design and Implementation of Computer Chinese Dark Chess Endgame Database. In: TCGA Computer Game Workshop, TCGA 2012 (2012)
Yen, S.-J., Chou, C.-W., Chen, J.-C., Wu, I.-C., Kao, K.-Y.: The Art of the Chinese Dark Chess Program DIABLE. In: Proc. of the Int. Computer Symposium (ICS-2012), pp. 231–242 (2013)
Lanctot, M., Saffidine, A., Veness, J., Archibald, C., Winands, M.H.M.: Monte Carlo *-Minimax Search. In: 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI-2013), pp. 580–586 (2013)
Chang, H.-J., Hsu, T.-S.: A Quantitative Study of 2 × 4 chinese dark chess. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 151–162. Springer, Heidelberg (2014)
Chen, B.-N., Hsu, T.-S.: Automatic Generation of Opening Books for Dark Chess. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 221–232. Springer, Heidelberg (2014)
Saffidine, A., Jouandeau, N., Buron, C., Cazenave, T.: Material symmetry to partition endgame tables. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 187–198. Springer, Heidelberg (2014)
Chen, J.-C., Lin, T.-Y., Chen, B.-N., Hsu, T.-S.: Equivalence Classes in Chinese Dark Chess Endgames. IEEE Trans. on Computational Intelligence and AI in Games (in press, 2014)
Childs, B.E., Brodeur, J.H., Kocsis, L.: Transpositions and move groups in Monte Carlo tree search. In: IEEE Symp. on Computational Intelligence and Games (CIG-2008), pp. 389–395 (2008)
Saito, J.-T., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Grouping Nodes for Monte-Carlo Go. In: Computer Games Workshop 2007 (CGW 2007), pp. 125–132 (2007)
Cowling, P.I., Powley, E.J., Whitehouse, D.: Information Set Monte Carlo Tree Search. IEEE Trans. on Computational Intelligence and AI in Games 4(2), 120–143 (2012)
Van Eyck, G., Müller, M.: Revisiting Move Groups in Monte-Carlo Tree Search. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 13–23. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jouandeau, N., Cazenave, T. (2014). Small and Large MCTS Playouts Applied to Chinese Dark Chess Stochastic Game. In: Cazenave, T., Winands, M.H.M., Björnsson, Y. (eds) Computer Games. CGW 2014. Communications in Computer and Information Science, vol 504. Springer, Cham. https://doi.org/10.1007/978-3-319-14923-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-14923-3_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14922-6
Online ISBN: 978-3-319-14923-3
eBook Packages: Computer ScienceComputer Science (R0)