Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site eosp1.UUCP
Path: utzoo!linus!philabs!seismo!harpo!floyd!vax135!ariel!houti!hogpc!houxm!mhuxl!ulysses!princeton!eosp1!robison
From: robison@eosp1.UUCP
Newsgroups: net.games
Subject: Re: go?
Message-ID: <322@eosp1.UUCP>
Date: Thu, 17-Nov-83 18:44:34 EST
Article-I.D.: eosp1.322
Posted: Thu Nov 17 18:44:34 1983
Date-Received: Sat, 19-Nov-83 01:48:15 EST
References: <140@cae780.UUCP>, <283@eosp1.UUCP> <1475@tekig1.UUCP>
Organization: Exxon Office Systems, Princeton, NJ
Lines: 27

Don Taylor points to the recent history of progress in chess
computers as an indication that computers will also play go.
I don't find this parallel encouraging.  Progress in computerchess
has been linked to:

  - Improvements in computer speed and lower computer cost

  - Trends toward exhaustive search chess programs

The strongest chess programs today use brute force to examine a lot
of positions per move.  They do use some shortcuts, to avoid wasted
searching, that are innovations.

If we can apply the same thing to GO:

  - where are the go-playing computers?

  - the exhaustive searches will be spectaularly longer because
    of the larger number of moves availabe in go.

We might say that when computers are fast enough to play go as well
as they now play chess, computers will play chess far, far better than
they do now.
				- Keremath,  care of:
				  Robison
			          decvax!ittvax!eosp1
				  or:   allegra!eosp1