[computer-go] Proximity to last move

Wodzu brucedickinson at wp.pl
Fri Nov 17 00:49:51 PST 2006


----- Original Message ----- 
From: "David Fotland" <fotland at smart-games.com>
To: "'computer-go'" <computer-go at computer-go.org>
Sent: Friday, November 17, 2006 12:37 AM
Subject: [computer-go] Proximity to last move


>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

Could You give an example of such pattern or maybe is there somwhere a list 
of
common patterns? 



More information about the computer-go mailing list