Re: computer-go: perfect play

["Vlad Dumitrescu" <vladdu@xxxxxxxxxxx>]

> Looking at a simple binary tree, where 1 is winning positions and 0 are
losing, we could have
>
> 0
> 1 1 1
> 110 100 000

A wining position is a position where one wins whatever the opponent does,
and similar for a losing one. There is no way to "turn around" the tables...
So there are actually 3 kinds of positions: winning, losing and undecided.

Otherwise the perfect game would be one of the following two

Black: <winning move>
White: resigns

or

Black: resigns

Not a very interesting vision, right? :-)
Vlad