Re: computer-go: Mathematical Go

[Darren Cook <darren@xxxxxxxxxxxxxxx>]

>> If you're trying to write a strong go-playing program this book will not be
>> any use. And for the part of the game it covers (very late endgame) brute
>> force search is just as practical.
>
>Brute force search scales differently, so that on a sufficiently large
>board, it's not necessarily true that brute force search is just as
>practical.

By "practical" I meant brute force will give you an equally good move
within tournament time limits (e.g. 10 secs/move) on just about all
positions that will come up in real games. And is much easier to implement
that CGT analysis. But I've not tried any comparisons.

So my point was that until CGT can work further back in the endgame it is
not needed for computer go. But I'm behind on my computer go reading, so
maybe Martin and others are managing to do this now.

Darren