Enhancements for multi-player Monte-Carlo tree search

DOI10.1007/978-3-642-17928-0_22zbMATH Open1316.68142OpenAlexW2109554237MaRDI QIDQ3073774FDOQ3073774

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

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

Recommendations

• An Analysis of UCT in Multi-player Games
• Pruning playouts in Monte Carlo tree search for the game of Havannah
• Monte-Carlo Tree Search Solver
• Towards generalizing the success of Monte-Carlo tree search beyond the game of Go
• Using evaluation functions in Monte-Carlo tree search

Mathematics Subject Classification ID

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

Cited In (4)

• Scalable Online Planning for Multi-Agent MDPs
• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
• An Analysis of UCT in Multi-player Games
• Multi-cut \(\alpha \beta\)-pruning in game-tree search

Uses Software

• MCTS-Solver

This page was built for publication: Enhancements for multi-player Monte-Carlo tree search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073774)