Re: [computer-go] SlugGo v.s. Many Faces

[wagjan@xxxxxxxxxxxxxxx]

Hi,

I suppose that there is a small branching factor at all level, or at 
least it is possible to branch at any level. But if there are 64 
processor, then averages barnching factor can not be higher then 
1.3 or searching time will be exponentional. But such a deep 
search seems to be meaningless except if there is a *very* good 
move selector. It would be more interested to take a bit wider 
search instead. I personally like wider search near the root. Eg. 
trying 4 moves at 1st ply and only two candidates at 6th ply.

Or I am just the next who misses the point ? :)))))))

Janos Wagner

> > The time is linear in the depth of search. The width of the search 
> > takes
> > virtually no wall clock time because different search paths are each
> > done on a different cpu in the cluster. At each branch new cpus are
> > brought into the calculation.
> 
> It was also my understanding that there is currently no branching 
> except on the first ply, that after the 1st ply the look ahead only 
> examine one move. There's no minimax involved yet. Is that correct? And 
> adding minimax would certainly be fun, but require many cpus!

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