[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: computer-go: perfect play
> It is easy to prove that if there is a winning strategy, it belongs to
> black. If white had it, black would just pass once, and play this winning
> "white" strategy.
Then white would pass, and the game ends with white winning
by komi :) (depending on the rules you use)
The argument reminds me of Hex, but in Hex, any move improves
the position of the player. Not necessarily in Go.
--
Tristan Cazenave
Universite Paris 8, Departement Informatique, Labo IA
2, rue de la Liberte 93526 Saint-Denis Cedex - France
http://www.ai.univ-paris8.fr/~cazenave/