summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
145d293)
On a final fixed game number test it failed
to prove better than standard version.
STC 15+0.05
ELO: -0.86 +-1.7 (95%) LOS: 15.8%
Total: 57578 W: 10070 L: 10213 D: 37295
bench:
8802105
Color RootColor;
Time::point SearchTime;
StateStackPtr SetupStates;
Color RootColor;
Time::point SearchTime;
StateStackPtr SetupStates;
- Value Contempt[2]; // [bestValue > VALUE_DRAW]
RootColor = RootPos.side_to_move();
TimeMgr.init(Limits, RootPos.game_ply(), RootColor);
RootColor = RootPos.side_to_move();
TimeMgr.init(Limits, RootPos.game_ply(), RootColor);
- DrawValue[0] = DrawValue[1] = VALUE_DRAW;
- Contempt[0] = Options["Contempt Factor"] * PawnValueEg / 100; // From centipawns
- Contempt[1] = (Options["Contempt Factor"] + 12) * PawnValueEg / 100;
+ int cf = Options["Contempt Factor"] * PawnValueEg / 100; // From centipawns
+ DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
+ DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
{
bestValue = search<Root>(pos, ss, alpha, beta, depth * ONE_PLY, false);
{
bestValue = search<Root>(pos, ss, alpha, beta, depth * ONE_PLY, false);
- DrawValue[ RootColor] = VALUE_DRAW - Contempt[bestValue > VALUE_DRAW];
- DrawValue[~RootColor] = VALUE_DRAW + Contempt[bestValue > VALUE_DRAW];
-
// Bring the best move to the front. It is critical that sorting
// is done with a stable algorithm because all the values but the
// first and eventually the new best one are set to -VALUE_INFINITE
// Bring the best move to the front. It is critical that sorting
// is done with a stable algorithm because all the values but the
// first and eventually the new best one are set to -VALUE_INFINITE