X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=c9526ec3c683e38a013089dfcd98bb661f3f2c0e;hp=d98ba4e42fb8a7c55962d48b0ebd9e5aad7a0d26;hb=8bb7a737087ca82cb97380bf06bbfa659dec1f73;hpb=081af9080542a0d076a5482da37103a96ee15f64 diff --git a/src/search.cpp b/src/search.cpp index d98ba4e4..c9526ec3 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -368,7 +368,6 @@ void Thread::search() { size_t pvFirst = 0; pvLast = 0; - Depth adjustedDepth = rootDepth; // MultiPV loop. We perform a full root search for each PV line for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx) @@ -388,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); @@ -405,7 +404,7 @@ void Thread::search() { int failedHighCnt = 0; while (true) { - adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY); + 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 @@ -428,7 +427,7 @@ void Thread::search() { && multiPV == 1 && (bestValue <= alpha || bestValue >= beta) && Time.elapsed() > 3000) - sync_cout << UCI::pv(rootPos, adjustedDepth, alpha, beta) << sync_endl; + sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl; // In case of failing low/high increase aspiration window and // re-search, otherwise exit the loop. @@ -463,15 +462,15 @@ void Thread::search() { if ( mainThread && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000)) - sync_cout << UCI::pv(rootPos, adjustedDepth, alpha, beta) << sync_endl; + sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl; } if (!Threads.stop) - completedDepth = adjustedDepth; + completedDepth = rootDepth; if (rootMoves[0].pv[0] != lastBestMove) { lastBestMove = rootMoves[0].pv[0]; - lastBestMoveDepth = adjustedDepth; + lastBestMoveDepth = rootDepth; } // Have we found a "mate in x"?