 When an artificial limit is hit, then you must make a heuristic judgment about which move to select.Normally, the tree would supply you with extensive evidence, like the intervals of root nodes.B* is a best-first process, which means that it is very efficient to traverse the tree, repeatedly descending to find a leaf to expand.