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

[Vincent Diepeveen <diep@xxxxxxxxx>]

At 20:24 3-12-2004 -0200, Mark Boon wrote:
>
>
>> -----Original Message-----
>> From: computer-go-bounces@xxxxxxxxxxxxxxxxx
>> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Vincent
>> Diepeveen
>> Sent: Friday, December 03, 2004 19:28
>> To: computer-go; computer-go
>> Subject: Re: [computer-go] Pattern matching - example play
>>
>>
>> The disadvantage of a localized search is also trivial: it will play
>> forever at a very weak level.
>>
>> It is not true that in go problems can get solved locally easily
>> because if
>> you just search whether you can save this certain group X, i could perhaps
>> create threats elsewhere which occupy an entire corner suddenly as i have
>> played a move at that spot which takes care i can win the fight elsewhere.
>>
>
>Uhm..., I think you're overlooking the possibility of local search with
>global evaluation.

I call that selective search which happens a few ply after nominal search.

>> There is another 100 trivial examples possible why local search sucks.
>>
>> Basically the advantage is that it is much easier to program it.
>>
>> So in the end the local search will get slowly extinct and
>> everyone will do
>> a global board search.
>>
>> Now the only question is: "WHEN".
>
>_______________________________________________
>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/