kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-29 16:23:09 +00:00
Code Issues Releases Wiki Activity

Revert F_90 and F_92

Browse source 
Regression test found the patches to be harmless,
so revert to keep code simpler.

Test1 at 20+0.1: (2500 - 3000) +0 ELO
Test2 at 1+0: (~1000) +2 ELO

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2010-08-18 10:05:28 +01:00
parent 252537fd9c
commit cf4c28ff86
1 changed files with 3 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

19
src/search.cpp
View file

@ -199,7 +199,7 @@ namespace {
Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2]; Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
// Minimum depth for use of singular extension // Minimum depth for use of singular extension
const Depth SingularExtensionDepth[2] = { 7 * OnePly /* non-PV */, 6 * OnePly /* PV */}; const Depth SingularExtensionDepth[2] = { 8 * OnePly /* non-PV */, 6 * OnePly /* PV */};
// If the TT move is at least SingularExtensionMargin better then the // If the TT move is at least SingularExtensionMargin better then the
// remaining ones we will extend it. // remaining ones we will extend it.
@ -970,7 +970,7 @@ namespace {
Move movesSearched[256]; Move movesSearched[256];
EvalInfo ei; EvalInfo ei;
StateInfo st; StateInfo st;
const TTEntry *tte, *ttx; const TTEntry *tte;
Key posKey; Key posKey;
Move ttMove, move, excludedMove, threatMove; Move ttMove, move, excludedMove, threatMove;
Depth ext, newDepth; Depth ext, newDepth;
@ -1207,22 +1207,9 @@ namespace {
&& move == tte->move() && move == tte->move()
&& ext < OnePly) && ext < OnePly)
{ {
// Avoid to do an expensive singular extension search on nodes where
// such search have already been done in the past, so assume the last
// singular extension search result is still valid.
if ( !PvNode
&& depth < SingularExtensionDepth[PvNode] + 5 * OnePly
&& (ttx = TT.retrieve(pos.get_exclusion_key())) != NULL)
{
if (is_upper_bound(ttx->type()))
ext = OnePly;
singularExtensionNode = false;
}
Value ttValue = value_from_tt(tte->value(), ply); Value ttValue = value_from_tt(tte->value(), ply);
if (singularExtensionNode && abs(ttValue) < VALUE_KNOWN_WIN) if (abs(ttValue) < VALUE_KNOWN_WIN)
{ {
Value b = ttValue - SingularExtensionMargin; Value b = ttValue - SingularExtensionMargin;
ss->excludedMove = move; ss->excludedMove = move;