Skip to content
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.

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

Simplify IIR #5062

Closed
Closed
Changes from all commits
Commits
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
8 changes: 3 additions & 5 deletions src/search.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -808,13 +808,11 @@ Value Search::Worker::search(
}

// Step 10. Internal iterative reductions (~9 Elo)
// For PV nodes without a ttMove, we decrease depth by 2,
// or by 4 if the current position is present in the TT and
// the stored depth is greater than or equal to the current depth.
// Use qsearch if depth <= 0.
// For PV nodes without a ttMove, we decrease depth by 3.
if (PvNode && !ttMove)
depth -= 2 + 2 * (ss->ttHit && tte->depth() >= depth);
depth -= 3;

// Use qsearch if depth <= 0.
if (depth <= 0)
return qsearch<PV>(pos, ss, alpha, beta);

Expand Down
Loading