Skip to main content

An Analysis of UCT in Multi-player Games

  • Conference paper
Computers and Games (CG 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5131))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Billings, D.: On the importance of embracing risk in tournaments. ICGA Journal 29(4), 199–202 (2006)

    Google Scholar 

  2. Ginsberg, M.: Gib: Imperfect information in a computationally challenging game. Journal of Articial Intelligence Research 14 (2001)

    Google Scholar 

  3. Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Proceedings of the 17th European Conference on Machine Learning, pp. 282–293. Springer, Heidelberg (2006)

    Google Scholar 

  4. Luckhardt, C., Irani, K.: An algorithmic solution of N-person games. In: AAAI 1986, vol. 1, pp. 158–162 (1986)

    Google Scholar 

  5. Sturtevant, N., Zinkevich, M., Bowling, M.: Probmaxn: Opponent modeling in n-player games. In: AAAI 2006, pp. 1057–1063 (2006)

    Google Scholar 

  6. Sturtevant, N.R.: Last-branch and speculative pruning algorithms for maxn. In: IJCAI 2003, pp. 669–678 (2003)

    Google Scholar 

  7. Sturtevant, N.R.: Multi-Player Games: Algorithms and Approaches. PhD thesis, Computer Science Department, UCLA (2003)

    Google Scholar 

  8. Sturtevant, N.R.: Current challenges in multi-player game search. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 285–300. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Sturtevant, N.R., Bowling, M.H.: Robust game play against unknown opponents. In: AAMAS 2006 (2006)

    Google Scholar 

  10. Sturtevant, N.R., White, A.M.: Feature construction for reinforcement learning in hearts. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 122–134. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. Jaap van den Herik Xinhe Xu Zongmin Ma Mark H. M. Winands

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sturtevant, N.R. (2008). An Analysis of UCT in Multi-player Games. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87608-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87607-6

  • Online ISBN: 978-3-540-87608-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics