Re: computer-go: perfect play

["Vlad Dumitrescu" <vladdu@xxxxxxxxxxx>]

> Your examples  would be a  perfect  game.  Maybe  we should also  view
> perfect moves  as requiring the  utmost resistance, even  when losing.
> In other words, you should delay your progress to the  end node of the
> tree.  Make your  opponent beat you.  Doesn't  that introduce a bit of
> GoDevil behavior?  I would think that GoDevil  would tend to delay the
> game in hopes of an error.

The point I wanted to make is that it isn't certain whether there is a
winning strategy for one of the players. (That might even be a more
interesting topic to discuss than how the perfect play looks like...)

Against GoGod or GoDevil hoping for them to err is pointless... if there is
a winning strategy, they will use it. If not, they will wait for the other
to err...

Of course, both GoGod and GoDevil would not play at all, because knowing the
outcome makes any game boring. If not plainly silly...

Does anyone know whether there are any speculations/theorems/thoughts about
wheter there is a winning strategy for any of the players in Go? I know of
some games where partial proofs are made...

/Vlad