So it's possible to create a triple-ko repetition, take that move sequence and
find a non-triple-ko situation that uses the exact same repeated move sequence?
A van Kessel wrote:
An alternative to matching board hashes is to test for repeated move sequences.
No. repeated position != repeated sequence.
Since one stone is added to the board with each move,
a repetition can only exist between two moves if exactly that number
of stones was captured inbetween (+- pass moves)
So you only have to check the positions in the game-stack
where exactly the same number of black,white stones is on the board
HTH,
AvK
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
