Re: computer-go: Search heuristics

[David Fotland <fotland@xxxxxxxxxxxxxxx>]

At 09:56 AM 11/23/99, you wrote:
>
>One of the things I was trying to do was find a way to say "if move A
>doesn't work, then move B can't possibly work". Humans do it all the time.
>Looking at the trees my program was searching it seemed like it was wasting
>lots of time in branches it should have known beforehand wouldn't work.
>
>E.g. if playing the primary lib (plib) doesn't work, then playing the
>secondary and tertiary libs (slibs & tlibs) will also fail. Unfortunately,
>sometimes they do work even when the plib move fails. So, most of my
>attempts led to it pruning branches it shouldn't.
>
>Has anyone had any luck with this? 

No.  But sorting the opponent's refuting move to try next avoids a lot
of this.

David

>
>Darren
>
>