[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.
yes, of course... I forgot about passing! :-)
But would not white pass himself too, after that? :~O
Maybe passing should not be a legal move except at the end of the game - and
of course use chinese counting rules. (for our discussion here, not for the
game as it is)
does black still have a winning strategy? since having an extra stone should
not be a disadvantage, black should get at least a draw (with no komi). I
don't think the perfect play would show that an extra stone might be a
losing strategy, but there is no proof yet...
> And as go is a game of full information, the winning strategy can be
nothing
> more complex than reading out the game tree. Theoretically simple, but not
> quite feasible with modern computers ;-)
not for any computer, if the full tree is to be explored and stored
somewhere... Hopefully, there will be found ways of cutting some corners!
Vlad