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

[Mark Boon]

On 9-aug-2006, at 19:42, Markus Enzenberger wrote:

> I only try the move for the attacker with more empty adjacent  
> points. Only if
> there is a tie, I try both moves.

Hmmm, I'm sure that's a heuristic that will work most of the time.  
But 'most of the time' is not nearly good enough for my purposes.

Obviously if you limit yourself to one candidate for the attacker the  
branch-factor will remain one. But that's not the same as solving a  
general 2-liberty problem. Solving them properly also doesn't take  
that much time, we're talking some microseconds per case, so I don't  
understand why one would want to skimp on a few candidates and run  
the risk of getting it wrong.

I also put a limit on the depth, but it's large enough to get some  
really crazy ladders right. But by limiting the depth I don't need to  
spend time watching out for triple-ko.

Mark

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