Enhancements for Multi-Player Monte-Carlo Tree Search

DOI10.1007/978-3-642-17928-0_22zbMath1316.68142OpenAlexW2109554237MaRDI QIDQ3073774

Mark H. M. Winands, J. A. M. Nijssen (Pim)

Publication date: 11 February 2011

Published in: Computers and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17928-0_22

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Experimental studies (91A90)

Related Items (2)

Scalable Online Planning for Multi-Agent MDPs ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information

Uses Software

• MCTS-Solver

This page was built for publication: Enhancements for Multi-Player Monte-Carlo Tree Search