Abstract
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an analysis of the UCT algorithm in multi-player games, showing that UCT, when run in a multi-player game, is computing a mixed-strategy equilibrium, as opposed to maxn, which computes a pure-strategy equilibrium. We analyze the performance of UCT in several known domains and show that it performs as well or better than existing algorithms. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sturtevant, N. R. (2008). An analysis of UCT in multi-player games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5131 LNCS, pp. 37–49). https://doi.org/10.1007/978-3-540-87608-3_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
