Skip to main content
Conference Proceedings

Multi-player go

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5131 LNCS 50-59
DOI: 10.1007/978-3-540-87608-3_5
11Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cazenave, T. (2008). Multi-player go. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5131 LNCS, pp. 50–59). https://doi.org/10.1007/978-3-540-87608-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free