Skip to main content
SpringerLink
Log in

Computer Go: A Grand Challenge to AI

  • Chapter
Book cover Challenges for Computational Intelligence

Part of the book series: Studies in Computational Intelligence ((SCI,volume 63))

Summary

The oriental game of Go is among the most tantalizing unconquered challenges in artificial intelligence after IBM's DEEP BLUE beat the world Chess champion in 1997. Its high branching factor prevents the conventional tree search approach, and long-range spatiotemporal interactions make position evaluation extremely difficult. Thus, Go attracts researchers from diverse fields who are attempting to understand how computers can represent human playing and win the game against humans. Numerous publications already exist on this topic with different motivations and a variety of application contexts. This chapter surveys methods and some related works used in computer Go published from 1970 until now, and offers a basic overview for future study. We also present our attempts and simulation results in building a non-knowledge game engine, using a novel hybrid evolutionary computation algorithm, for the Capture Go game.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Allis LV, Van den Herik HJ, Herschberg IS (1991) “Which games will sur-vive?” In D. N. L. Levy andD. F. Beal, editors, Heuristic Programming in Artificial Intelligence 2-The Second Computer Olympiad, pp. 232-243, Ellis Horwood.

    Google Scholar 

  2. Berlekamp E, Conway J, Guy R (1982) Winning Ways, Academic Press, New York.

    MATH  Google Scholar 

  3. Berlekamp E, Wolfe D (1994) Mathematical Go: Chilling Gets the Last Point. A. K. Peters., MA, USA

    MATH  Google Scholar 

  4. Cai X, Wunsch II DC (2004) “Evolutionary computation in playing Cap-tureGo game,” Proc. of ICCNS’04, Boston.

    Google Scholar 

  5. Cai X, Zhang N, Venayagamoorthy GK, Wunsch II DC (2005) “Time series prediction with recurrent neural networks using hybrid PSO-EA algorithm,” Neurocomputing, (Accepted).

    Google Scholar 

  6. Chellapilla K, Fogel D (1999) “Evolution, neural networks, games, and intelligence,” Proceedings of the IEEE, vol. 87, no. 9, pp. 1471-1496, September.

    Article  Google Scholar 

  7. Chellapilla K, Fogel D (1999) “Evolving neural networks to play Checkers without relying on expert knowledge,” IEEE Trans. on Neural Networks, vol. 10, no. 6, pp. 1382-1391, November.

    Article  Google Scholar 

  8. Chellapilla K, Fogel D (2001) “Evolving an expert Checkers playing pro-grams without using human expertise,” IEEE Trans. on Evolutionary Computation, vol. 5, no. 4, pp. 422-428, August.

    Article  Google Scholar 

  9. Chen K, Chen Z (1999) “Static analysis of life and death in the game of Go,” Information Science, Vol. 121, pp. 113-134.

    Article  Google Scholar 

  10. Chen X, Zhang D, Zhang X, Li Z, Meng X, He S, Hu X (2003) “A func-tional MRI study of high-level cognition II. The game of GO,” Cognitive Brain Research, 16(1): 32-37.

    Article  Google Scholar 

  11. Chen Z (1995) “Programming technics in Handtalk,” http://www.wulu.com/ht-techn.htm.

  12. Convey J (1976) On Numbers and Games, Academic Press, London/NewYork.

    Google Scholar 

  13. Enderton HD (1991) “The Golem Go program,” Tech. Rep. CMU-CS-92-101, Carnegie Mellon University.

    Google Scholar 

  14. Enzenberger M (1996) “The integration of a priori knowledge into a Go playing neural network”.Available: http://www.markus-enzenberger.de/neurogo.ps.gz

  15. Fogel D (2002) Blondie24: Playing at the Edge of AI. SF, CA: Morgan Kaufmann.

    Google Scholar 

  16. Fogel D, Hays TJ, Hahn SL and Quon J (2004) “A self-learning evolution-ary Chess program,” Proc. of the IEEE, vol. 92, no. 12, pp. 1947-1954, December.

    Article  Google Scholar 

  17. Fotland D (1999) The 1999 FOST (Fusion of Science and Technology) cup world open computer championship, Tokyo. Available: http://www. britgo.org/results/computer/fost99htm

  18. Fürnkranz J (2001) Machine learning in games: A survey. J. Fürnkranz & M. Kubat (eds.): Machines that Learn to Play Games, Nova Scientific Publishers, Chapter 2, pp. 11-59, Huntington, NY.

    Google Scholar 

  19. Goerlitz S http://www.schachverein-goerlitz.de/Foren/Fun/Go/go.htm

  20. Gomez F, Miikkulainen R (1997) “Incremental evolution of complex gen-eral behavior,” Adaptive Behavior, vol. 5, pp. 317-342.

    Article  Google Scholar 

  21. Hsu F (2002), Behind Deep Blue. Princeton, NJ: Princeton Univ. Press.

    MATH  Google Scholar 

  22. Kennedy J,. Eberhart R (1995) “Particle Swarm Optimization,” IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948, Nov. 27-Dec. 1, Perth, Australia.

    Google Scholar 

  23. Kennedy J,. Eberhart R, Shi Y (2001) Swarm Intelligence. San Meteo, CA: Morgan Kaufmann.

    Google Scholar 

  24. Konidaris G, Shell D, Oren N (2002) “Evolving neural networks for the capture game,” Proc. of the SAICSIT postgraduate symposium, Port Elizabeth, South Africa. Available from: http://www-robotics.usc.edu/∼dshell/res/evneurocapt.pdf

  25. Moriarty DE, Miikkulainen R (1994) “Evolving neural networks to focus minimax search,” Proc. of National Conference on Artificial Intelligence (AAAI-94), pp. 1371-1377.

    Google Scholar 

  26. Muller M (1999) “Decomposition search: A combinatorial games ap-proach to game tree search, with applications to solving Go endgames,” Proc. of IJCAI, vol. 1, pp. 578-583.

    Google Scholar 

  27. Muller M (2002) “Position evaluation in computer Go,” ICGA Journal, Vol. 25, No. 4, pp. 219-228.

    Google Scholar 

  28. Muller M (2003) “Conditional combinatorial games and their application to analyzing capturing race in Go,” Information Science, Vol. 154, pp. 189-202.

    Article  Google Scholar 

  29. Newman B (1988) “Wally, a simple minded Go-program,” ftp://imageek.york.cuny.edu/nngs/Go/comp/.

  30. Pollack JB, Blair AD (1998) “Co-evolution in the successful learning of Backgammon strategy,” Machine Learning, Vol. 32, pp. 226-240.

    Article  Google Scholar 

  31. Pratola M, Wolfe T (2003) “Optimizing GoTools’ search heuristics using genetic algorithms,” ICGA Journal, vol. 26, no. 1, pp. 28-48.

    Google Scholar 

  32. Prokhorov D and Wunsch II DC (1997) “Adaptive critic designs,” IEEE Trans. on Neural Networks, vol. 8, no. 5, pp. 997-1007, September.

    Article  Google Scholar 

  33. Reiss M (1995) e-mail sent in January 1995 to the computer Go mailing list, http://www.cs.uoregon.edu/∼richard/computer-go/.

  34.  Reitman W, Kerwin J, Nado R, Reitman J, Wilcox B (1974) “Goals and plans in a program for playing Go,” Proc. of the 29th National Conference of the ACM, pp. 123-127.

    Google Scholar 

  35. Reitman W, Wilcox B (1975) “Perception and representation of spatial relations in a program for playing Go,” Proc. of the 30th National Conference of the ACM, pp. 37-41.

    Google Scholar 

  36. Reitman W, Wilcox B (1978) “Pattern recognition and pattern-directed inference in a program for playing Go,” In D. Waterman and F. HayesRoth, editors, Pattern Directed Inference Systems, pp. 503-523, Academic Press, New York.

    Google Scholar 

  37. Ryder J (1971) “Heuristic analysis of large tree as generated in the game of Go,” PhD thesis, Department of Computer Science, Stanford Univer-sity.

    Google Scholar 

  38. Richards N, Moriarty D, McQuesten P, Miikkulainen R (1998) “Evolving neural networks to play Go,” Applied Intelligence, vol. 8, pp. 85-96.

    Article  Google Scholar 

  39. Schraudolph N, Dayan P, Sejnowski T (1994) “Temporal difference learn-ing of position evaluation in the game of Go,” Advances in Neural Information Processing, vol. 6, pp. 817-824.

    Google Scholar 

  40. Schraudolph N, Dayan P, Sejnowski T (2000) “Learning to evaluate Go position via temporal difference methods,” In L. Jain and N. Baba Eds, Soft Computing Techniques in Game Playing, Springer Verlag, Berlin.

    Google Scholar 

  41. Schwefel (1995) Evolution and Optimum Seeking. Wiley, NY.

    Google Scholar 

  42. Shannon CE (1950) “Automatic Chess player,” Scientific American 182, No. 48.

    Google Scholar 

  43. Smith A (1956) The Game of Go, Charles Tuttle Co., Tokyo, Japan.

    Google Scholar 

  44. Sutton R (1988) “Learning to predict by the method of temporal differ-ences,” Machine Learning, No. 3, pp. 9-44.

    Google Scholar 

  45. Tesauro G (1992)“Practical issue in temporal difference learn-ing,”Machine Learning, No. 8, pp. 257-278.

    MATH  Google Scholar 

  46. Wilcox B (1985) “Reflections on building two Go programs,” ACM SIGART Newsletter, pp. 29-43.

    Google Scholar 

  47. Zaman R, Prokhorov DV, Wunsch II DC (1997) “Adaptive critic design in learning to play the game of Go,” Proc. of the International Joint Conference on Neural Networks, vol. 1, pp. 1-4, Houston.

    Google Scholar 

  48. Zaman R, Wunsch II DC (1999) “TD methods applied to mixture of ex-perts for learning 9x9 Go evaluation function,” Proc. of the International Joint Conference on Neural Networks, vol. 6, pp. 3734-3739

    Google Scholar 

  49.  Zobrist A (1970) “Feature extractions and representation for pattern recognition and the game of Go,” PhD thesis, Graduate School of the University of Wisconsin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Missouri, Rolla

    Xindi Cai

  2. University of Missouri, Rolla

    Donald C. Wunsch II

Authors
  1. Xindi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donald C. Wunsch II
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Nicolaus Copernicus University, Ul. Grudziadzka 5, 87-100, Torun, Poland

    Włodzisław Duch

  2. Division of Computer Science, School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Włodzisław Duch

  3. Faculty of Mathematics and Information Sciences, Warsaw University of Technology, Plac Politechniki 1, 00-661, Warsaw, Poland

    Jacek Mańdziuk

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cai, X., Wunsch, D.C. (2007). Computer Go: A Grand Challenge to AI. In: Duch, W., Mańdziuk, J. (eds) Challenges for Computational Intelligence. Studies in Computational Intelligence, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71984-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71984-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71983-0

  • Online ISBN: 978-3-540-71984-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation