Talk:Computer Go

Article Checklist for "Computer Go"

Workgroup category or categories	Games Workgroup, Computers Workgroup [Editors asked to check categories]
Article status	Developing article: beyond a stub, but incomplete
Underlinked article?	Yes
Basic cleanup done?	No
Checklist last edited by	Pat Palmer 13:16, 23 April 2007 (CDT)

To learn how to fill out this checklist, please see CZ:The Article Checklist.

---

first comment

User:Ronald BeimelI noticed a reference to "8-9 year old professionals". To my knowledge, the youngest people to become professional did so at around ages 10-11, however I have no hard facts to back this up. Thoughts anyone?

Need to back up statements of computational complexity

I feel that is statements are made such as "go endgames are proved to be PSPACE-hard" or "life and death which are also known to be NP-hard" then external references should be made to those proofs. Maybe some of these are relevant?

• GJ 257 [GP11].
• D. Lichtenstein and M. Sipser, Go is polynomial-space hard, J. ACM 27 (1980) 393-401.
• J. M. Robson, The complexity of Go, Proc. IFIP (1983) 413-417.
• J. M. Robson. Combinatorial games with exponential space complete decision problems. Proc. Mathematical Foundations of Computer Science, Springer-Verlag, LNCS 176, 1984, pp. 498-506.
• E. Berlekamp and D. Wolfe, Mathematical Go: Chilling Gets the Last Point, A. K. Peters, 1994.
• D. Wolfe, Go endgames are hard, MSRI Combinatorial Game Theory Research Worksh., 2000.
• M. Crâşmaru and J. Tromp, Ladders are PSPACE-complete, Proc. 2nd Int. Conf. Computers and Games, Springer-Verlag, 2000, pp. 241-249.