Re: [computer-go] Pattern matching - example play

[Vincent Diepeveen <diep@xxxxxxxxx>]

At 09:39 2-12-2004 +0100, Heikki Levanto wrote:
>On Wed, Dec 01, 2004 at 08:27:20PM +0100, Vincent Diepeveen wrote:
>> 
>> 20 ply brute force is no problem either in 9x9. Of course using nullmove
>> and some later techniques and a good hashtable.
>> 
>
>Searching all those positions is not a hard problem. Evaluating the
>resulting positions is hard.

Obviously that will be the problem. However at this moment the go software
is where chess was, from tactical viewpoint, in 1979. It's missing basic
tactics thanks to life&death.

Look i'm not saying chessprograms were so great at the time, nor that go
software is primitive or anything like that as i saw Mark Boon interpret
it. I'm just using it to show what obvious tactics gets missed by software
right now. A few years later the first pro's were beaten in chess. 
In Go that will take longer obviously.

A deeper brute force search is an absolute necessity to make it into the
dan levels with go software. Without that, the weakest chain is and will be
just some life&death tactics.

>-- 
>Heikki Levanto   "In Murphy We Turst"     heikki (at) lsd (dot) dk
_______________________________________________
>computer-go mailing list
>computer-go@xxxxxxxxxxxxxxxxx
>http://www.computer-go.org/mailman/listinfo/computer-go/
>
>
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/