Talk:Computer Go

From Citizendium
Jump to navigation Jump to search
This article is developing and not approved.
Main Article
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition Field of artificial intelligence dedicated to creating a computer program that plays the ancient board game go. [d] [e]
Checklist and Archives
 Workgroup categories Games and Computers [Editors asked to check categories]
 Talk Archive none  English language variant Not specified

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.