mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-06 10:53:50 +08:00
Remove risk tolerance
Passed STC: LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 379328 W: 97567 L: 97724 D: 184037 Ptnml(0-2): 909, 44861, 98314, 44638, 942 https://tests.stockfishchess.org/tests/view/680defc63629b02d74b15b62 Passed LTC: LLR: 2.94 (-2.94,2.94) <-1.75,0.25> Total: 160752 W: 40762 L: 40685 D: 79305 Ptnml(0-2): 60, 17548, 45091, 17609, 68 https://tests.stockfishchess.org/tests/view/680e8ff43629b02d74b15e65 closes https://github.com/official-stockfish/Stockfish/pull/6037 Bench: 1897340
This commit is contained in:
@@ -28,7 +28,6 @@
|
||||
#include <cstdlib>
|
||||
#include <initializer_list>
|
||||
#include <iostream>
|
||||
#include <limits>
|
||||
#include <list>
|
||||
#include <ratio>
|
||||
#include <string>
|
||||
@@ -116,29 +115,6 @@ void update_correction_history(const Position& pos,
|
||||
<< bonus * 141 / 128;
|
||||
}
|
||||
|
||||
int risk_tolerance(Value v) {
|
||||
// Returns (some constant of) second derivative of sigmoid.
|
||||
static constexpr auto sigmoid_d2 = [](int x, int y) {
|
||||
return 631760 * x / ((x * x + 3 * y * y) * y);
|
||||
};
|
||||
|
||||
// a and b are the crude approximation of the wdl model.
|
||||
// The win rate is: 1/(1+exp((a-v)/b))
|
||||
// The loss rate is 1/(1+exp((v+a)/b))
|
||||
int a = 340;
|
||||
int b = 122;
|
||||
|
||||
// guard against overflow
|
||||
assert(abs(v) + a <= std::numeric_limits<int>::max() / 644800);
|
||||
|
||||
// The risk utility is therefore d/dv^2 (1/(1+exp(-(v-a)/b)) -1/(1+exp(-(-v-a)/b)))
|
||||
// -115200x/(x^2+3) = -345600(ab) / (a^2+3b^2) (multiplied by some constant) (second degree pade approximant)
|
||||
int winning_risk = sigmoid_d2(v - a, b);
|
||||
int losing_risk = sigmoid_d2(v + a, b);
|
||||
|
||||
return -(winning_risk + losing_risk) * 32;
|
||||
}
|
||||
|
||||
// Add a small random component to draw evaluations to avoid 3-fold blindness
|
||||
Value value_draw(size_t nodes) { return VALUE_DRAW - 1 + Value(nodes & 0x2); }
|
||||
Value value_to_tt(Value v, int ply);
|
||||
@@ -1219,9 +1195,6 @@ moves_loop: // When in check, search starts here
|
||||
r -= moveCount * 66;
|
||||
r -= std::abs(correctionValue) / 28047;
|
||||
|
||||
if (PvNode && std::abs(bestValue) <= 2078)
|
||||
r -= risk_tolerance(bestValue);
|
||||
|
||||
// Increase reduction for cut nodes
|
||||
if (cutNode)
|
||||
r += 2864 + 966 * !ttData.move;
|
||||
|
||||
Reference in New Issue
Block a user