Extra penalty for PV move in previous ply when it gets refuted.
STC:
LLR: 4.49 (-2.94,2.94) [-1.50,4.50]
Total: 41094 W: 7889 L: 7620 D: 25585
LTC:
LLR: 2.95 (-2.94,2.94) [0.00,6.00]
Total: 12304 W: 1967 L: 1811 D: 8526
Bench:
8373608
Resolves #386
- moveCount = quietCount = 0;
+ moveCount = quietCount = ss->moveCount = 0;
bestValue = -VALUE_INFINITE;
ss->ply = (ss-1)->ply + 1;
bestValue = -VALUE_INFINITE;
ss->ply = (ss-1)->ply + 1;
+
+ ss->moveCount = moveCount;
if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
{
moveCount--;
if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
{
moveCount--;
+ ss->moveCount = moveCount;
cmh.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
}
cmh.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
}
- // Extra penalty for TT move in previous ply when it gets refuted
- if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove && !pos.captured_piece_type())
+ // Extra penalty for PV move in previous ply when it gets refuted
+ if (is_ok((ss-2)->currentMove) && (ss-1)->moveCount==1 && !pos.captured_piece_type())
{
Square prevPrevSq = to_sq((ss-2)->currentMove);
HistoryStats& ttMoveCmh = CounterMovesHistory[pos.piece_on(prevPrevSq)][prevPrevSq];
{
Square prevPrevSq = to_sq((ss-2)->currentMove);
HistoryStats& ttMoveCmh = CounterMovesHistory[pos.piece_on(prevPrevSq)][prevPrevSq];
Depth reduction;
Value staticEval;
bool skipEarlyPruning;
Depth reduction;
Value staticEval;
bool skipEarlyPruning;
};
/// RootMove struct is used for moves at the root of the tree. For each root move
};
/// RootMove struct is used for moves at the root of the tree. For each root move