Re: computer-go: Live or Die

[David Fotland <fotland@xxxxxxxxxxxxxxx>]

Many Faces does a very selective best-first search.  The current
version also has some major bugs in the static eye evaluation since
I'm part way through a major change.  Many Faces does not stop at
the first move that works.  It tries to find all moves that work,
since this is necessary to play go rather than solve problems.

At 02:00 PM 11/25/99 EST, you wrote:
>problem? I think it's a good idea if we can put forward several benchmark 
>problems so that people can compare results with each other. Following is 
>some problems I tried.
>
>Problem 1:
>
>Black: a4,b4,c2,c3,c4
>White: a5,b5,c5,d1,d2,d5,e1,e2,e3,e4,e5
>
>about 3 second with 1600 evaluations. Depth limit = 8.

Without reading static evaluation thinks black is unsettled.
Black first, 42 evaluations to 99% confidence that B2 lives.
White first, 29 evaluations to 100% confidence that C1 kills

>
>Problem 2:
>
>Black: b4,b5,c2,c3,c4,d2
>White: a7,b6,b7,c5,c6,d3,d4,d5,e2,e3,f1,f2
>
>81 second with 32000 evaluations. depth limit = 9

Without reading, static evaluation thinks black is unsettled.
Black first, 121 evaluations to 100% confidence of living.
White first, 232 evaluations to 3% confidence of killing.  group is alive.

>
>
>Problem 3:
>
>Black: b4,c4,d2,d3,d4
>White: a6,b5,b6,c5,d5,e2,e3,e4,e5,f1,f2
>
>Note that this is not the Carpenter square.
>
>80 minutes with 1.5 million evaluations. Depth limit = 12

Without reading, static evaluation thinks black is likely alive.
Black first, 1084 evaluations to 100% confidence of living, but
it never tried B2 due to a bug :)  It thinks B3 is the best move
to live. (about 13 seconds.  this is the only one I timed.)  If
I put a black stone at B2, white uses 211 evaluations to prove
that it can't be killed.
White first, 361 evaluations to 100% confidence of killing, with D1,
again without trying B2.

David Fotland

>
>
>Black moves first in all above problems. My computer is K-6 233 MHz.
>
>
>Dan Liu
>
>