Revert "Don't prune discovered checks"

Both Lucas re-test and Jean-Francois confirrm it
is a regression.

Here Jean-Francois's results after 3600 games :
Score of 96d3b1c92b vs 3b87314: 690 - 729 - 2181 [0.495] 3600
ELO: -3.86 +- 99%: 14.94 95%: 11.35
LOS: 15.03%
Wins: 690 Losses: 729 Draws: 2181 Total: 3600

Bench: 5404066
This commit is contained in:
Marco Costalba
2012-11-11 11:04:58 +01:00
parent 96d3b1c92b
commit c45a4e0b48
4 changed files with 12 additions and 22 deletions
+3 -7
View File
@@ -483,8 +483,7 @@ namespace {
Depth ext, newDepth;
Value bestValue, value, ttValue;
Value eval, nullValue, futilityValue;
CheckType givesCheck;
bool inCheck, pvMove, singularExtensionNode;
bool inCheck, givesCheck, pvMove, singularExtensionNode;
bool captureOrPromotion, dangerous, doFullDepthSearch;
int moveCount, playedMoveCount;
@@ -816,7 +815,7 @@ split_point_start: // At split points actual search starts from here
if (PvNode && dangerous)
ext = ONE_PLY;
else if (givesCheck && (givesCheck == DISCO_CHECK || pos.see_sign(move) >= 0))
else if (givesCheck && pos.see_sign(move) >= 0)
ext = ONE_PLY / 2;
// Singular extension search. If all moves but one fail low on a search of
@@ -883,7 +882,6 @@ split_point_start: // At split points actual search starts from here
// Prune moves with negative SEE at low depths
if ( predictedDepth < 2 * ONE_PLY
&& givesCheck != DISCO_CHECK
&& pos.see_sign(move) < 0)
{
if (SpNode)
@@ -1104,8 +1102,7 @@ split_point_start: // At split points actual search starts from here
Key posKey;
Move ttMove, move, bestMove;
Value bestValue, value, ttValue, futilityValue, futilityBase;
CheckType givesCheck;
bool enoughMaterial, evasionPrunable, fromNull;
bool givesCheck, enoughMaterial, evasionPrunable, fromNull;
Depth ttDepth;
ss->currentMove = bestMove = MOVE_NONE;
@@ -1237,7 +1234,6 @@ split_point_start: // At split points actual search starts from here
if ( !PvNode
&& (!InCheck || evasionPrunable)
&& move != ttMove
&& givesCheck != DISCO_CHECK
&& type_of(move) != PROMOTION
&& pos.see_sign(move) < 0)
continue;