// Start with a small aspiration window and, in the case of a fail
// high/low, re-search with a bigger window until we don't fail
// high/low anymore.
- failedHighCnt = 0;
+ int failedHighCnt = 0;
while (true)
{
Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
if (ttCapture)
r++;
- // Increase reduction at root if failing high
- if (rootNode)
- r += thisThread->failedHighCnt * thisThread->failedHighCnt * moveCount / 512;
-
// Increase reduction for cut nodes (~3 Elo)
if (cutNode)
r += 2;