Peter Drake wrote:
out.writeObject(root);
Storing the root node of the Monte Carlo search will get storeObject() called on all the siblings and children (assuming you are using an implementation similar to the one on http://senseis.xmp.net/?UCT.
With 10.000 nodes, the depth of the tree is a little less than with 2.000.000 nodes. Since for each sibling (important) and each child (not so important), the writeObject() method is called, you get that stack overflow.
Since there are as many siblings per move as valid moves, the recursion depth grows quite quickly.
You can avoid that by not calling writeObject(this.sibling), but doing that in a while (...) loop.
Roland _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
