> Since AMAF values are so helpful, perhaps one can let go of the idea of > sequential play following the rules of go, and basically play moves in > parallel on all empty intersection. Compute new state (do captures) and > repeat a fixed number of times and evaluate.
two thoughts: i) how do you determine color to play for each thread? ii) if i) becomes unsynchronized with the rules of go, you're basically exploring random boards instead of boards that are related to the game that you're interested in. the board should rapidly converge to something that retains no information about the initial state of the board (assuming that the initial board has stones on it). s. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
