Re: [computer-go] A chess programmer at the Go-Olympiad

[David Fotland <fotland@xxxxxxxxxxxxxxx>]

I was just replying to the whole string.

Many Faces doesn't do full board look ahead in the computer chess sense.

It searches a set of fixed local move trees.  These can be joseki sequences,
standard pattern sequences from the pattern database, or single moves suggested
by a variety of move generators.  At each leaf it does a full board 
quiescence search,
looking at attacking/defending moves, local replies, etc.  Some moves only 
get searched
one ply at the full board, and some get searched 20 ply or more.

David

At 01:16 AM 12/9/2003 +0100, Arend Bayer wrote:
> On Sun, 7 Dec 2003, David Fotland wrote:
>
> > I don't understand the comment that go programs don't use search.  Go
>
> You say this in a reply to my e-mail as if I had come up with that
> statement. But I was just quoting it from Chrilly Donninger. I suppose
> what he meant by this statement is that many go programs do _not_ use
> full board lookahead. I happen to know that such is the case for GNU Go :)
> And it's probably right for most of the programs that took part in Graz,
> only exceptions I am aware of are Smart-Go and Aya.
>
> As you have explained, Many Faces does use full-board lookahead, and
> the other top programs probably use it, too. And I am convinced we have
> to add it to GNU Go some time, too.
>
> Best,
> Arend
>
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://computer-go.org/mailman/listinfo/computer-go

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://computer-go.org/mailman/listinfo/computer-go