
www.Usenet.com
| <-- __Chronological__ --> | <-- __Thread__ --> |
JavaGirl <[EMAIL PROTECTED]> wrote in message news:<[EMAIL PROTECTED]>... [...] > The last problem that someone had said could not be solved is > ?GO.? Namely, having a process that would allow the computer to > play an advanced game of GO. > > This problem has been solved with my ITS applied to GO. (K-GO1). Has been solved? i.e., you have such a process now? Well, maybe it *allows* the computer to play an advanced game of go, but to my opinion, your ITS has that much cognition that it doesn't *want* to play an advanced game any more. Some advice, for if you ever decide to publish some results: - in go, each move is counted, and not each pair of moves as in chess - there is quite wide-spread agreement on ascii-notation for a go board. It looks quite different from yours. Maybe have a look at rec.games.go? - fix your terminology: if you say you *solved* a game, that would mean you now from move 1 who wins the game. greetings, Maarten.
| <-- __Chronological__ --> | <-- __Thread__ --> |
Please check out one of the premium Usenet Newsgroup Service Providers below for access to Usenet.