Re: [computer-go] Parallel lookahead with GNU Go

[Gunnar Farnebäck <gunnar@xxxxxxxxxxxxxx>]

David wrote:
> Playing white against GNU Go 3.2 with no handicap, we used GNU Go
> 3.2 to generate possible moves. We selected 4 lookahead paths and ran
> them out 8 moves. We used a weighted linear combination of GNU Go's
> estimate of the value of the original moves and GNU Go's estimate of the
> overall influence in the final positions to select one move from the 4. 
> We
> beat GNU Go almost all of the time, usually by a substantial margin. The
> small number of times we lost, the margin was small.
> 
> I could write about my opinions of what I saw, but only if folks care 
> enough
> to ask me. I would guess that it is only of interest to GNU Go 
> developers.

If people here are not otherwise interested, you can always send a
report to the GNU Go development list, gnugo-devel@xxxxxxxxxxxxxxxxx We are of
course interested and can provide feedback on your set-up.

> GNU Go 3.4 does not have the influence function we had been using,

This confuses me. I can't remember any influence function disappearing
between 3.2 and 3.4. What exactly are you using? (Better move this to
the GNU Go list.)

> so we played our modified 3.2-with-lookahead against 3.4. 3.4
> trounced 3.2 with lookahead by over a 100 point margin. We only did
> the one run.

One run indicates nothing; that is certainly not a typical result
between 3.4 and 3.2 (without lookahead). But of course you should base
your experiments on the most recent release.

/Gunnar (co-maintainer of GNU Go)
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://computer-go.org/mailman/listinfo/computer-go