Skip to main content
SpringerLink
Log in

Multi-player Go

  • 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

Multi-player Go is Go played with more than two colors. Monte-Carlo Tree Search is an adequate algorithm to program the game of Go with two players. We address the application of Monte-Carlo Tree Search to multi-player Go.

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

Access this chapter

Log in via an institution
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. Bouzy, B., Cazenave, T.: Computer Go: An AI-Oriented Survey. Artificial Intelligence 132(1), 39–103 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brügmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)

    Google Scholar 

  3. Cazenave, T.: Playing the right atari. ICGA Journal 30(1), 35–42 (2007)

    MathSciNet  Google Scholar 

  4. Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Computer Games Workshop 2007, Amsterdam, The Netherlands, June 2007, pp. 93–101 (2007)

    Google Scholar 

  5. Coulom, R.: Efficient selectivity and back-up operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML, pp. 273–280 (2007)

    Google Scholar 

  7. Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in monte-carlo go. Technical Report 6062, INRIA (2006)

    Google Scholar 

  8. Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Korf, R.E.: Multi-player alpha-beta pruning. Artif. Intell. 48(1), 99–111 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Loeb, D.E.: Stable winning coalitions. In: Games of No Chance, vol. 29, pp. 451–471 (1996)

    Google Scholar 

  11. Luckhart, C., Irani, K.B.: An algorithmic solution of n-person games. In: AAAI, pp. 158–162 (1986)

    Google Scholar 

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

    Google Scholar 

  13. 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 

  14. Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games. In: AAAI/IAAI, pp. 201–207 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIASD, Université Paris 8, 93526, Saint-Denis, France

    Tristan Cazenave

Authors
  1. Tristan Cazenave
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Cazenave, T. (2008). Multi-player Go. 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_5

Download citation

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

  • 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

Search

Navigation