I finally managed to build a program that can produce a sequence of random legal go moves. One problem I found recently is that it rarely never ends a game because of triple ko, especially on small boards.
One possible solution would be saving every board position that has occurred and searching for a match before generating a move. But this doesn't sound like an efficient solution at all. How do you handle this problem? Also as a side question, white constantly seems to have a better winning rate in any board size larger than 9x9 with komi greater than 6 under area scoring in completely random games; is this natural?
_______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
