Seems like a silly title. Any game of perfect information that has a clear rule set can be solved. Plus, some would argue that any Go already is solved (write simple algorithm and wait 1 billion years while it runs). A better question is, "Can Computer Go Surpass Human Go?" But again, clearly it will. It's just a question of how long until it occurs.
Without being too pedantic, I'd like to note that although all two-player games with perfect information and finite length have winning strategies, it is not always the case that they are either computable or decidable. This caveat likely does not apply to games such as 19x19 go, but it just might apply to the question of finding a winning strategy for go on an NxN board, for instance. For an example of such a game, see: J.P. Jones, Some undecidable determined games, International Journal of Game Theory, 11 (1982) s. ____________________________________________________________________________________ 8:00? 8:25? 8:40? Find a flick in no time with the Yahoo! Search movie showtime shortcut. http://tools.search.yahoo.com/shortcuts/#news _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
