Re: computer-go: unmake move?

[David Fotland <fotland@xxxxxxxxxxxxxxx>]

Almost.  Black starts with 2 liberties, but has two move
choices since there is a white stone in atari.  That's why
I was surprised at the claim in the paper that a heuristic
search can't solve it in 44K nodes, and that it took 
Abstract Proof Search 787 nodes.

David


At 03:04 PM 6/16/00 +0900, Martin Mueller wrote:
>
>    + + @ @ @ @ @ + |
>    + + + O O O @ i |
>    + @ + O @ @ O O k
>    + @ O b O @ @ c h
>    + @ + d @ O a g j
>    _ _ _ f e _ _ _ _
>
>I may be missing something, but: isn't this simply a ladder problem?
>
>	Martin
>
>