Re: computer-go: Why Ko

[David Mechner <mechner@xxxxxxxxxxx>]

There have been quite a few professional games that (because of prolonged
kos and small territories) went over N^2 moves.
-David

> In message <3B334311.3105284B@xxxxxxxxxxxxxxxxx>, Erik van der Werf
> <E.vanderWerf@xxxxxxxxxxxxxxxxx> writes
> >I think that if a player plays more than N^2 moves in one game on an NxN
> >board, you can safely conclude that he plays badly.
> >
> >Therefore you could limit the number of moves to (possibly even a
> >fraction of) N^2. If a player makes more moves he should then
> >automatically loose the game. (I believe something like this is called
> >T-truncated Go)