opelly/Stockfish
1
0
Fork 0
mirror of https://github.com/opelly27/Stockfish.git synced 2026-05-20 10:57:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revert previous patch

Browse Source 
It seems a regression at 15+0.05:
ELO: -4.82 +-2.1 (95%) LOS: 0.0%
Total: 40000 W: 7181 L: 7736 D: 25083

bench: 8331357
This commit is contained in:
Marco Costalba
2013-11-17 23:47:18 +01:00
parent 917944e9c5
commit c376ffce0f
3 changed files with 10 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+10 -5
View File
@@ -484,6 +484,7 @@ namespace {
assert(PvNode || (alpha == beta - 1));
assert(depth > DEPTH_ZERO);
Move quietsSearched[64];
StateInfo st;
const TTEntry *tte;
SplitPoint* splitPoint;
@@ -493,7 +494,7 @@ namespace {
Value bestValue, value, ttValue, eval, nullValue, futilityValue;
bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
bool captureOrPromotion, dangerous, doFullDepthSearch;
int moveCount;
int moveCount, quietCount;
// Step 1. Initialize node
Thread* thisThread = pos.this_thread();
@@ -514,7 +515,7 @@ namespace {
goto moves_loop;
}
moveCount = 0;
moveCount = quietCount = 0;
bestValue = -VALUE_INFINITE;
ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
ss->ply = (ss-1)->ply + 1;
@@ -900,6 +901,8 @@ moves_loop: // When in check and at SpNode search starts from here
pvMove = PvNode && moveCount == 1;
ss->currentMove = move;
if (!SpNode && !captureOrPromotion && quietCount < 64)
quietsSearched[quietCount++] = move;
// Step 14. Make the move
pos.do_move(move, st, ci, givesCheck);
@@ -1074,9 +1077,11 @@ moves_loop: // When in check and at SpNode search starts from here
// played non-capture moves.
Value bonus = Value(int(depth) * int(depth));
History.update(pos.moved_piece(bestMove), to_sq(bestMove), bonus);
for (const ExtMove* em = mp.quiet_moves(); em && em->move != bestMove; ++em)
History.update(pos.moved_piece(em->move), to_sq(em->move), -bonus);
for (int i = 0; i < quietCount - 1; ++i)
{
Move m = quietsSearched[i];
History.update(pos.moved_piece(m), to_sq(m), -bonus);
}
if (is_ok((ss-1)->currentMove))
Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, bestMove);