RE: computer-go: perfect players

[Azathoth <shoffman@xxxxxxxxx>]

from the book: A Course in Game Theory(1994, Martin J. Osborne & Ariel
Rubinstein)
"Every finite extensive game with perfect information has a subgame
perfect equilibrium"(p.99)

In english: assuming perfect ability to analyze a game, he can develop a
strategy that will ensure him of at least an tie, no matter what strategy
the opponent is using. 

And so it goes,
-seth

On Fri, 4 May 2001, Allan Crossman wrote:

> 
> >If you define perfect the way I define it (no mind reading or learning about
> >your opponent), you would only need to play two games, one with player A as
> >Black, one with player A as white.  Both games would be exactly the same
> >because both players are exactly the same (perfect).
> 
> This is only true if at no point does either player have two or more moves
> that lead to the same result. In fact I suspect that for Go and many other
> games there are probably millions of possible "perfect games".
> 
> 
> 
> 
>                     Allan Crossman
>                http://www.faldara.co.uk
> ------------------------------------------------------
> PGP Keys: 0x497F13C8 (New) and 0xCEC9FAE1 (Compatible)
> 
>