Re: computer-go:life and death

[bridges@xxxxxxxxxxxxxx (Patrick G. Bridges)]

>>>>> "DF" == David Fotland <fotland@xxxxxxxxxxxxxxxxx> writes:

    DF> If you want results in a full playing program, speed is
    DF> important.  And the hard-coded life/death
    DF> reading algorithms get better results than the rule based
    DF> systems.  One problem with rule-based sytems
    DF> is that they are brittle.  Their assertions are either true or
    DF> false.  I've found that to play well, the system
    DF> has to use confidence estimates, since very few of the static
    DF> evaluations are completely certain.

Isn't this a good argument for something like B* search, which was
built to take advantage of these kinds of estimates? How well do you
think this avoid the brittleness problem you speak of, David?

-Patrick Bridges

-- 
*** Patrick G. Bridges  	     	bridges@xxxxxxxxxxxxxxxxx ***
***                #include <std/disclaimer.h>		       ***