Closed CWRules closed 4 years ago
Tree search time can vary pretty significantly. Instead of a fixed max depth, decide whether to build the next tree level based on how long the current one took.
Looks like tree search takes ~1ms per node visited.
Program now assumes next level will take (nodes_visited) * 0.001s to compute, and terminates if this will take longer than the allotted search time.
Tree search time can vary pretty significantly. Instead of a fixed max depth, decide whether to build the next tree level based on how long the current one took.