X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=8a32e827488739ea351a4ee77d0532138b578ffa;hp=7dc674882ee4315b3fe8922c7ab6d2252ab456c9;hb=9315ba60e68198452940a57292f27e37bc3b6ed2;hpb=97d2cc9a9c1c4b6ff1b470676fa18c7fc6509886 diff --git a/src/search.cpp b/src/search.cpp index 7dc67488..8a32e827 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; @@ -933,10 +940,15 @@ moves_loop: // When in check, search starts from here extension = ONE_PLY; } else if ( givesCheck // Check extension (~2 Elo) - && !moveCountPruning && pos.see_ge(move)) extension = ONE_PLY; + // Extension for king moves that change castling rights + if ( type_of(movedPiece) == KING + && pos.can_castle(us) + && depth < 12 * ONE_PLY) + extension = ONE_PLY; + // Calculate new depth for this move newDepth = depth - ONE_PLY + extension; @@ -1133,8 +1145,6 @@ moves_loop: // When in check, search starts from here break; } } - else if (PvNode && !rootNode && value == alpha) - update_pv(ss->pv, move, (ss+1)->pv); } if (move != bestMove)