Implement time limited iterative deepening search for chess program

218 Views Asked by At

I know i can implement this by checking for time limit before calling move generator in the negamax and quiescence functions. But I would Like to know if there is a way to run the check for time limit on a separate thread and break the execution of the loop if time limit is exceeded in C++.

0

There are 0 best solutions below