[computer-go] KO in Hashtable-UCT?

[Peter Drake]

True...

My experience has been that (largely) ignoring the extremely rare  
case of superko is a better use of the finite resources we have.

Have others found the same thing?

Peter Drake
http://www.lclark.edu/~drake/



On May 18, 2007, at 9:19 AM, Chris Fant wrote:

>> 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.
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20070518/1863b5d3/attachment.htm