Small and Large MCTS Playouts Applied to Chinese Dark Chess Stochastic Game [chapter]

Nicolas Jouandeau, Tristan Cazenave
2014 Communications in Computer and Information Science  
Monte-Carlo tree search is a powerful paradigm for full 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 size, with true or evaluated wins. Results show that extending playout size over the real draw condition is beneficial to group-nodes and to chance-nodes. It also shows that using
more » ... luation function can reduce the number of draw games with group-nodes and can be increased with chance-nodes.
doi:10.1007/978-3-319-14923-3_6 fatcat:6k2wlk7f5zcnrbxrrw7knrud7y