An Analysis of UCT in Multi-player Games

9 years 4 months ago
An Analysis of UCT in Multi-player Games
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.
Nathan R. Sturtevant
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CG
Authors Nathan R. Sturtevant
Comments (0)