Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bu-cs!spike
From: spike@bu-cs.BU.EDU (Spike)
Newsgroups: comp.emacs
Subject: Re: Gomoku: a strategic board game for GNU Emacs.
Message-ID: <13301@bu-cs.BU.EDU>
Date: Tue, 22-Sep-87 16:00:46 EDT
Article-I.D.: bu-cs.13301
Posted: Tue Sep 22 16:00:46 1987
Date-Received: Thu, 24-Sep-87 06:19:27 EDT
References: <1547@culdev1.UUCP>
Reply-To: spike@bu-it.UUCP (Joe Ilacqua)
Organization: Boston University Distributed Systems Group
Lines: 23

In article <1547@culdev1.UUCP> drw@culdev1.UUCP (Dale Worley) writes:
>jat@hpsemc.UUCP (Joe Talmadge) writes:
>> Speaking of Gomuku (and not at all of emacs, oh well), does anyone
>> know anything about a computerized Go game, like the computerized
>> chess games?  Or is Go not widely played enough, or too complicated?
>
>From what I've heard, the number of potential moves from any position
>in Go is so large that tree searching doesn't work.  Thus, there's
>never been a good Go program.  (But the Japanese are working on it as
>an AI project.)  Oddly enough, good computer chess programs all use
>tree searching, but good human chess players don't.
>
>Dale

	As I recall there is a very large prize, still unclamed, for
the first person who writes an Go program that can be certified at the
Go equivalent of a chess master.  And yes, when I was taking lisp
a while back the professor showed us that the Go game tree was
unmanageably large.  Tho not knowing Go I can prove it now...


-- 
->Spike