[computer-go] How to improve my minimax speed?

[Chris Fant]

I doubt any serious Go programs base their move selection on proximity
to the last move.


On 11/16/06, Darren Cook <darren at dcook.org> wrote:
> > My simple idea is to analyze first moves near the last move on board,
> > ...
> > Ofcourse we can extend this idea by gathering not only one last move but
> > few of them and on this basis create priority queue.
>
> Sounds reasonable. But it will still require you to go through far too
> many moves. The more sophisticated way would be to use a pattern
> library, either hand-crafted or automatically harvested.
>
> As a simple example of where it would be superior: if there are no
> stones close to the last move played then playing 1 or 2 steps away is
> likely to be a better move than playing next to it.
>
> Darren
>
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
>