X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=832501f2f70d94437625b35c836692b63f86c2fa;hp=30f77bd9af80c10155af469acf9afce9ff86304e;hb=82697f1193cc8c99c99c282361a3ada25c758243;hpb=d42e6338ea2ac347e682475473dbc7b088b6985e diff --git a/src/search.cpp b/src/search.cpp index 30f77bd9..832501f2 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -69,7 +69,9 @@ namespace { // Razor and futility margins const int RazorMargin1 = 590; const int RazorMargin2 = 604; - Value futility_margin(Depth d) { return Value(150 * d / ONE_PLY); } + Value futility_margin(Depth d, bool improving) { + return Value((175 - 50 * improving) * d / ONE_PLY); + } // Futility and reductions lookup tables, initialized at startup int FutilityMoveCounts[2][16]; // [improving][depth] @@ -349,10 +351,7 @@ void Thread::search() { ct = Options["Contempt"] * PawnValueEg / 100; // From centipawns // Adjust contempt based on current bestValue (dynamic contempt) - int sign = (bestValue > 0) - (bestValue < 0); - ct += bestValue > 500 ? 70 : - bestValue < -500 ? -70 : - bestValue / 10 + sign * int(std::round(3.22 * log(1 + abs(bestValue)))); + ct += int(std::round(48 * atan(float(bestValue) / 128))); Eval::Contempt = (us == WHITE ? make_score(ct, ct / 2) : -make_score(ct, ct / 2)); @@ -678,6 +677,10 @@ namespace { ss->staticEval, TT.generation()); } + improving = ss->staticEval >= (ss-2)->staticEval + /* || ss->staticEval == VALUE_NONE Already implicit in the previous condition */ + ||(ss-2)->staticEval == VALUE_NONE; + if (skipEarlyPruning || !pos.non_pawn_material(pos.side_to_move())) goto moves_loop; @@ -702,7 +705,7 @@ namespace { // Step 8. Futility pruning: child node (skipped when in check) if ( !rootNode && depth < 7 * ONE_PLY - && eval - futility_margin(depth) >= beta + && eval - futility_margin(depth, improving) >= beta && eval < VALUE_KNOWN_WIN) // Do not return unproven wins return eval;