On Jul 14, 2009, at 9:58 AM, Don Dailey wrote:
I think most programs completely ignore this issue except for simple ko. I think for all practical purposes you can consider 2 positions identical if they have the same set of legal moves possible, considering only simple ko.
Orego's Zobrist hash includes the stones on the board, the simple ko position, and whose turn it is.
You probably don't want to ignore this in the tree itself though. If a move is illegal due to any kind of ko, don't expand it. So your tree will be proper and correct, but some particular node may have data generated from positions that are technically different due to GHI issues.
We only check for superko right before actually making a move (i.e., not in the tree or in playouts).
Peter Drake http://www.lclark.edu/~drake/
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
