Re: [computer-go] Computer Go tournament at EGF

[Arend Bayer <arend.bayer@xxxxxx>]

On Fri, 11 Feb 2005, Erik van der Werf wrote:

> David G Doshay wrote:
> 
> > SlugGo plays to a specified search depth. Because this is a serial
> > search I can think of no way to speed this up beyond what we have
> > already done with hash tables, other than to make search depth
> > a time dependent variable.
> 
> 
> You could try to implement something like iterative deepening.

I don't understand what you mean by iterative deepening in the context
of SlugGo's search. Remember it only branches at ply=1, and the number
of branches is smaller than the number of available CPU's in their
cluster. So the search time is mostly
	depth*(time per move of the slowest GNU Go instance)

Arend


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