[computer-go] Proximity to last move

[Chris Fant]

I stand corrected.


On 11/16/06, David Fotland <fotland at smart-games.com> wrote:
> Most of the strong programs use pattern matching to select moves to try.
> Usually there are some patterns that are centered on the last move, so they
> will do move selection based on the last move.  Since the list of moves must
> be highly pruned, it makes sense to sort it so moves near the last moves are
> searched first (since they are more likely to be good).  If an enemy move
> threatens a group, I give priority to moves that save that group over moves
> that save other groups that became threatened on earlier moves.
>
> I don't use pure proximity, but I do look at local responses first.
>
> David
>
> > -----Original Message-----
> > From: computer-go-bounces at computer-go.org
> > [mailto:computer-go-bounces at computer-go.org] On Behalf Of Chris Fant
> >
> >
> > I doubt any serious Go programs base their move selection on
> > proximity to the last move.
> >
> >
>
>
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
>