X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=d0bbc9675c9618ff780cb51b3f89a8eb8abf31f6;hp=639c5bc55bf9a1d6d676d29bf2678ed80241cccf;hb=df50ea5dc635457dd34fd08c0d332889483f5e7f;hpb=9fff27220917d706988185cbd847e3f355a7fe09 diff --git a/src/search.cpp b/src/search.cpp index 639c5bc5..d0bbc967 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -387,7 +387,7 @@ void Thread::search() { if (rootDepth >= 5 * ONE_PLY) { Value previousScore = rootMoves[pvIdx].previousScore; - delta = Value(18); + delta = Value(20); alpha = std::max(previousScore - delta,-VALUE_INFINITE); beta = std::min(previousScore + delta, VALUE_INFINITE); @@ -401,9 +401,11 @@ void Thread::search() { // 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. + int failedHighCnt = 0; while (true) { - bestValue = ::search(rootPos, ss, alpha, beta, rootDepth, false); + Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY); + bestValue = ::search(rootPos, ss, alpha, beta, adjustedDepth, false); // Bring the best move to the front. It is critical that sorting // is done with a stable algorithm because all the values but the @@ -436,12 +438,17 @@ void Thread::search() { if (mainThread) { + failedHighCnt = 0; failedLow = true; Threads.stopOnPonderhit = false; } } else if (bestValue >= beta) + { beta = std::min(bestValue + delta, VALUE_INFINITE); + if (mainThread) + ++failedHighCnt; + } else break; @@ -936,6 +943,12 @@ moves_loop: // When in check, search starts from here && pos.see_ge(move)) extension = ONE_PLY; + // Extension for king moves that change castling rights + if ( pos.can_castle(us) + && type_of(movedPiece) == KING + && depth < 12 * ONE_PLY) + extension = ONE_PLY; + // Calculate new depth for this move newDepth = depth - ONE_PLY + extension;