CWRules / Othello_Python

Othello-playing AI
GNU General Public License v3.0
0 stars 0 forks source link

Variable maximum search depth #8

Closed CWRules closed 4 years ago

CWRules commented 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.

CWRules commented 4 years ago

Looks like tree search takes ~1ms per node visited.

CWRules commented 4 years ago

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.