[computer-go] Caching of local search in NeuroGo?

[Mark Boon]

On 9-aug-2006, at 10:49, Markus Enzenberger wrote:

> yes, the branching factor can be greater than 1, but these cases are
> relatively rare, the average branching factor is very close to 1.

I don't see how they can be rare unless you eliminate part of the  
search on heuristic criteria. But then you shouldn't count those. If  
the ladder doesn't run, i.e. it can't be captured, the chasing party  
will have a branching factor of 2 at every move. Only the branching  
factor of the escaping party will be close to 1. I suppose ladders  
run about half of the time only, in which cases with proper move- 
ordering you get a branching factor close to 1.

Can one say that statistically the branching factor is 1.25?

Mark

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20060809/a2f66c09/attachment.htm