Re: [computer-go] Chess programs versus go programs

[Darren Cook <darren@xxxxxxxxx>]

> > It sounds like you are suggesting computational game theory (CGT)
> > ...
> I've made a serious attempt on this in the past, but didn't have much
> success. The endgame positions in Berlekamp's examples are very simple and
> not much use in real play. I tried to make a module that would compute the
> 'value' of simple local end-game positions like the following:
>
>           |...XXO..   |.XOOO..
> |XXXOOO.  |..dXOO..   |..XXO..
> |.......  |..bac...   |.......
> |------   |--------   |-------
>
> After a few weeks the results were still very disappointing, basically
> because even on these simple positions it took forever to get a result. 
I basically had the same tried-and-failed experience. I kept coming up 
against needing perfect life-and-death analysis to get useful numbers. So I 
went back to that (but staying within the context of solving 9x9 endgames).

Darren
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/