An Analysis of UCT in Multi-player Games

  title={An Analysis of UCT in Multi-player Games},
  author={Nathan R. Sturtevant},
  booktitle={Computers and 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 max, 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… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
67 Citations
16 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 67 extracted citations

113 Citations

Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 16 references

Probmaxn: Opponent modeling in n-player games

  • N. Sturtevant, M. Zinkevich, M. Bowling
  • In AAAI-2006,
  • 2006
Highly Influential
11 Excerpts

An Analysis of UCT in Multi - player Games

  • N. R. Sturtevant
  • Proceedings of the 6 th International Conference…
  • 2008

White . Feature construction for reinforcement learning in hearts

  • M. A.
  • Computers and Games ( CG
  • 2006

Bowling . Robust game play against unknown opponents

  • H. M.
  • 2004

Similar Papers

Loading similar papers…