Skip to content

add a soft time limit in ID loop #52

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
kevlu8 merged 1 commit into from
Jun 21, 2025
Merged

add a soft time limit in ID loop #52

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 15 additions & 10 deletions engine/search.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -537,35 +537,40 @@ std::pair<Move, Value> search(Board &board, int64_t time, bool quiet) {
result = __search(board, d, alpha, beta, board.side ? -1 : 1);
if (early_exit) break;
}
if (early_exit)
break;
if (early_exit) break;
eval = result.second;
best_move = result.first;

seldepth = std::max(seldepth, d);

#ifndef NOUCI
#ifndef NOUCI
if (!quiet) {
if (abs(eval) >= VALUE_MATE_MAX_PLY) {
std::cout << "info depth " << d << " seldepth " << seldepth << " score mate " << (VALUE_MATE - abs(eval)) / 2 * (eval > 0 ? 1 : -1) << " nodes "
<< nodes << " nps " << (nodes / ((double)(clock() - start) / CLOCKS_PER_SEC)) << " pv ";
<< nodes << " nps " << (nodes / ((double)(clock() - start) / CLOCKS_PER_SEC)) << " pv ";
__print_pv(1);
std::cout << "hashfull " << (board.ttable.size() * 1000 / board.ttable.mxsize()) << " time " << (clock() - start) / CLOCKS_PER_MS << std::endl;
} else {
std::cout << "info depth " << d << " seldepth " << seldepth << " score cp " << eval / CP_SCALE_FACTOR << " nodes " << nodes << " nps "
<< (nodes / ((double)(clock() - start) / CLOCKS_PER_SEC)) << " pv ";
<< (nodes / ((double)(clock() - start) / CLOCKS_PER_SEC)) << " pv ";
__print_pv();
std::cout << "hashfull " << (board.ttable.size() * 1000 / board.ttable.mxsize()) << " time " << (clock() - start) / CLOCKS_PER_MS << std::endl;
}
}
#endif

#endif
exit_allowed = true;

if (abs(eval) >= VALUE_MATE_MAX_PLY) {
return {best_move, eval};
// We don't need to search further, we found mate
}

int time_elapsed = (clock() - start) / CLOCKS_PER_MS;
if (time_elapsed > mxtime / 2) {
// We probably won't be able to complete the next ID loop
break;
}
}

return {best_move, eval / CP_SCALE_FACTOR};
Expand Down