Abstract
The field of Computer Go has seen impressive progress over the last decade. However, its future prospects are unclear. This paper suggests that the obstacles to progress posed by the current structure of the community are at least as serious as the purely technical challenges. To overcome these obstacles, I develop three possible scenarios, which are based on approaches used in computer chess, for building the next generation of Go programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L.V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, 1994.
I. Althöfer. A symbiosis of man and machine beats grandmaster Timoshchenko. ICCA Journal, 21(1):40–47, 1997.
D.B. Benson. Life in the game of Go. Information Sciences, 10:17–29, 1976. Reprinted in Computer Games, Levy, D.N.L. (Editor), Vol. II, pp. 203–213, Springer Verlag, New York 1988.
E. Berlekamp. The economist’s view of combinatorial games. In S. Levy, editor, Games of No Chance: Combinatorial Games at MSRI. Cambridge University Press, 1996.
T. Cazenave. Systeme d’Apprentissage Par Auto-Observation. Application au jeu de Go. PhD thesis, University of Paris, 1997. www-laforia.ibp.fr/~cazenave/-papers.html.
M. Enzenberger. The integration of a priori knowledge into a Go playing neural network. cgl.ucsf.edu/go/Programs/NeuroGo.html, 1996.
D. Fotland. Knowledge representation in The Many Faces of Go. Report posted on internet newsgroup rec.games.go, 1993. Available by ftp from ftp://igs.nuri.net.
D. Fotland. Computer Go design issues. http://www.usgo.org/computer/text/-designissues.text, 1996.
S. Hu and P. Lehner. Multipurpose strategic planning in the game of Go. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(9):1048–1051, 1997.
K.Y. Kao. Sums of Hot and Tepid Combinatorial Games. PhD thesis, University of North Carolina at Charlotte, 1997.
A. Kierulf. Smart Game Board: a Workbench for Game-Playing Programs, with Go and Othello as Case Studies. PhD thesis, ETH Zürich, 1990.
T. Kojima. Automatic Acquisition of Go Knowledge from Game Records: Deductive and Evolutionary Approaches. PhD thesis, University of Tokyo, 1998.
T. Kojima, K. Ueda, and S. Nagano. An evolutionary algorithm extended by ecological analogy and its application to the game of go. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 684–689, 1997. http://www.brl.ntt.co.jp/people/kojima/research.
J. Kraszek. Heuristics in the life and death algorithm of a Go-playing program. Computer Go, 9:13–24, 1988.
S. McConnell. Rapid Development. Microsoft Press, 1996.
M. Müller. Game theories and Computer Go. In Proc. of the Go and Computer Science Workshop (GCSW’93), Sophia-Antipolis, 1993. INRIA.
M. Müller. Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. PhD thesis, ETH Zürich, 1995. Diss.Nr.11.006.
M. Müller. American Go Association Computer Go Pages. http://www.usgo.org-/computer, 1997.
M. Müller. Generalized thermography: A new approach to evaluation in Computer Go. In H. Iida, editor, Proceedings of IJCAI-97 Workshop on Computer Games on Using Games as an Experimental Testbed for AI Research, pages 41–49, Nagoya, 1997.
M. Müller. Playing it safe: Recognizing secure territories in Computer Go by using static rules and search. In H. Matsubara, editor, Proceedings of the Game Programming Workshop in Japan’ 97, pages 80–86, Computer Shogi Association, Tokyo, Japan, 1997.
E. Pettersen. The Computer Go Ladder. http://www.cgl.ucsf.edu/go/ladder.html, 1994.
P. Verhelst. Chess program sources. http://www.xs4all.nl/~verhelst/chess/sources.html, 1997.
L. Weaver. COMPUTER-GO Mailing List Archive. http://www.hsc.fr/computer-go, 1998.
B. Wilcox. Chess is easy. Go is hard. Computer Game Developers Conference. home.sprynet.com/sprynet/vrmlpro/cgdc.html, 1997.
T. Wolf. Investigating tsumego problems with RisiKo. In D.N.L. Levy and D.F. Beal, editors, Heuristic Programming in Artificial Intelligence 2. Ellis Horwood, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, M. (1999). Computer Go: A Research Agenda. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-48957-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65766-8
Online ISBN: 978-3-540-48957-3
eBook Packages: Springer Book Archive