[computer-go] KO in Hashtable-UCT?

[Chris Fant]

> After search, when actually making a move:
> 1) Make a copy of the board
> 2) Compute the Zobrist hash of the current position from scratch
> 3) Check for superko violations (against a stack of previous Zobrist hashes
> for positions in the real game,)
> 4) If there is a violation, go back to the copy and try the next best move

But then you have an engine which does not converge to perfect play
given infinite resources.