Aja wrote:
> It is not really expensive to detect and avoid superko in simulations. Some
> repetitions occur every 4 moves, so you only need to incrementally keep
> four keys and compare two keys. For instance,
>
> Key1 position before the third last move
> Key2 position before the second last move
> Key3 position before the last move
> Key4 current position
Is four moves the longest super-ko cycle possible? I thought it could be
longer, using some capture and refill approach. But I could be very
wrong on that.
Darren
P.S. Well if the bots are psychotic, and because tromp-taylor rules
allow suicide, then of course very long cycles are possible, with one
player always passing, and the other player filling in the same large
eye over and over...
My question is more: is a very long cycle possible in a game where both
players are playing to win?
>
> To check super ko for move a in the current position, just do
>
> if (Key1 == ComputeZobristKey(Key4, a))
> {
> // Forbid move a
> }
--
Darren Cook, Software Researcher/Developer
http://dcook.org/work/ (About me and my work)
http://dcook.org/blogs.html (My blogs and articles)
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
