An Analysis of UCT in Multi-player Games

DOI10.1007/978-3-540-87608-3_4MaRDI QIDQ3601819zbMATH OpenOpenAlexFDO

Authors Nathan R. Sturtevant

Publication date 12 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-87608-3_4

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)

Recommendations

• Enhancements for multi-player Monte-Carlo tree search
• Towards generalizing the success of Monte-Carlo tree search beyond the game of Go
• Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
• Monte Carlo tree search with robust exploration
• Amazons Discover Monte-Carlo

Cites work

• GIB: Imperfect information in a computationally challenging game

Cited in

(6)

• Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
• Enhancements for multi-player Monte-Carlo tree search
• Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
• Temporal-difference search in Computer Go
• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
• Nonasymptotic Analysis of Monte Carlo Tree Search

Describes a project that uses

Uses Software

• GIB

This page was built for publication: An Analysis of UCT in Multi-player Games

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