When Mogo runs on the supercomputer with long-ish time limits, how big does
> the search tree get?
>
Plotting the depth/number of nodes as a function of the thinking time might
be a good idea... No idea :-( I just remember that changing the number of
visits before adding a new node in the tree cha
When Mogo runs on the supercomputer with long-ish time limits, how big does the
search tree get?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
