My starting point is that the root node is different from all other nodes. The purpose of any particular search is to select the next move. Once a particular child is far enough behind the leaders, it's effectively eliminated, and any additional effort spent to investigate it is a waste.
For example, suppose we're going to search for 10 seconds, 5 seconds have passed, the leading node has 10,000 visits, and some other node has 100. It's mathematically impossible for the weak node to ever replace the strong one. I'm looking for a mathematical framework for making that kind of decision on an ongoing basis. Ideally, the top level nodes will be eliminated one by one, as the probability that they would have eventually been the winning choice falls below a chosen threshold. _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
