Combinatorics of Go

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4630 LNCS, Issue , 2007, Pages 84-99

  Tromp, John ^a   Farnebäck, Gunnar ^b  

^a CWI   (Netherlands)

^b HARVARD MEDICAL SCHOOL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; ERROR ANALYSIS;

DYNAMIC PROGRAMMING ALGORITHMS;

GAME THEORY;

EID: 38049016955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75538-8_8     Document Type: Conference Paper

References (10)

1. Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, London (1983)
2. Chen, P.: Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs. SIAM J. Comput. 21(2), 295-315 (1992)
3. Crâşmaru, M., Tromp, J.: Ladders are PSPACE-complete. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 241-249. Springer, Heidelberg (2002)
4. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, London (1994)
5. Lichtenstein, D., Sipser, M.: GO is Polynomial-Space Hard. Journal of the ACM 27(2), 393-401 (1980)
6. Robson, J.M.: The Complexity of Go. In: Proc. IFIP (International Federation of Information Processing), pp. 413-417 (1983)
7. Tromp, J.: The Game of Go (2006), http://www.cwi.nl/~tromp/go.html
8. Tromp, J.: Number of Legal Go Positions (2006), http ://www.cwi.nl/ ~tromp/go/legal.html
9. Woeginger, G.: Personal communication
10. Wolfe, D.: Go endgames are PSPACE-hard. In: Nowakowski, R.J. (ed.) More Games of No Chance, vol. 42, pp. 125-136. MSRI Publications (2002)