Abstract is missing.
- Minimizing Simple and Cumulative Regret in Monte-Carlo Tree SearchTom Pepels, Tristan Cazenave, Mark H. M. Winands, Marc Lanctot. 1-15 [doi]
- On Robustness of CMAB Algorithms: Experimental ApproachAntonín Komenda, Alexander Shleyfman, Carmel Domshlak. 16-28 [doi]
- Job-Level Algorithms for Connect6 Opening Position AnalysisTing-Han Wei, I-Chen Wu, Chao-Chin Liang, Bing-Tsung Chiang, Wen-Jie Tseng, Shi-Jim Yen, Chang-Shing Lee. 29-44 [doi]
- Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation FunctionsHendrik Baier, Mark H. M. Winands. 45-63 [doi]
- Monte-Carlo Tree Search for the Game of "7 Wonders"Denis Robilliard, Cyril Fonlupt, Fabien Teytaud. 64-77 [doi]
- Small and Large MCTS Playouts Applied to Chinese Dark Chess Stochastic GameNicolas Jouandeau, Tristan Cazenave. 78-89 [doi]
- On the Complexity of General Game PlayingÉdouard Bonnet, Abdallah Saffidine. 90-104 [doi]
- Efficient Grounding of Game Descriptions with TablingJean-Noël Vittaut, Jean Méhat. 105-118 [doi]
- SHPE: HTN Planning for Video GamesAlexandre Menif, Eric Jacopin, Tristan Cazenave. 119-132 [doi]
- Predicting Player Disengagement in Online GamesHanting Xie, Daniel Kudenko, Sam Devlin, Peter I. Cowling. 133-149 [doi]
- Coordinating Dialogue Systems and Stories through Behavior CompositionStefano Cianciulli, Daniele Riccardelli, Stavros Vassos. 150-163 [doi]