RE: [computer-go] Modern brute force search in go

["David Fotland" <fotland@xxxxxxxxxxxxxxx>]

> Also in go, in order to beat the pro's in a year or 30, you 
> MUST use brute force searching algorithms.
> 
> If you don't use them, you *always* will keep playing at 
> utmost beginners level.
> 
> Of course with hyper selectivity you take care that seemingly 
> good lines you see deeper than idiotic lines.
> 

Hi Vincent,

I don't understand what you mean by brute force searching, when you next say
hyper selectivity.  

Many Faces uses alpha-beta at the full board, with hyper selectivity,
since it only looks at 5 to 20 moves at the first ply, and typically 1 to 3
moves thereafter.
It searches some lines 1 ply deep, and other lines 30 ply deep.  It doesn't
visit many
nodes since it evaluates less than 100 nodes per second.  This is because
the evaluations
do extensive tactical search, up to 80 ply deep, but typically 10 to 20 ply
deep.

Is this Brute Force Search by your definition?  I consider it to be highly
selective, knowledge
based search.  But it is alpha-beta, and it is hyperselective, and it does
search some lines much 
deeper than others.

David



_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/