Thank your for your response, Chris. I think as Allis et al (1991, 1994) points out there is a difference in 'crackable' and 'solvable' where the former tend to be search-based complexities and the later decision-based complexity. Irrespective of the opponent via the cracking approach the best theoretical results can be achieved naturally even more easily if there are less decision-based considerations. Given the nature of go 'solvable', explicably in human terms, can pertain to an awful lot that is not so well defined to give rise to an exact or best solution or method by which to understand decisions?
L. V. Allis. Searching for Solutions in Games and Artificial Intelligence. Ph.D. thesis, Rijksuniversiteit Limburg, Maastricht, The Netherlands, 1994. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
