X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.cpp;h=22116412c863c4e0a5efadbed4abf61931eb7e2b;hp=edd5cdb7c500a6e86166705c3eb47097db982fb1;hb=87303d7ed307766b51908541512f9a209dc99032;hpb=25286e9932f7e28e1d0cddffb0b1e7df3232de7c diff --git a/src/history.cpp b/src/history.cpp index edd5cdb7..22116412 100644 --- a/src/history.cpp +++ b/src/history.cpp @@ -42,8 +42,6 @@ History::History() { clear(); } void History::clear() { memset(history, 0, 2 * 8 * 64 * sizeof(int)); - memset(successCount, 0, 2 * 8 * 64 * sizeof(int)); - memset(failureCount, 0, 2 * 8 * 64 * sizeof(int)); } @@ -58,13 +56,12 @@ void History::success(Piece p, Square to, Depth d) { assert(square_is_ok(to)); history[p][to] += int(d) * int(d); - successCount[p][to]++; // Prevent history overflow if (history[p][to] >= HistoryMax) for (int i = 0; i < 16; i++) for (int j = 0; j < 64; j++) - history[i][j] /= 4; + history[i][j] /= 2; } @@ -72,12 +69,18 @@ void History::success(Piece p, Square to, Depth d) { /// called for each non-capturing move which failed to produce a beta cutoff /// at a node where a beta cutoff was finally found. -void History::failure(Piece p, Square to) { +void History::failure(Piece p, Square to, Depth d) { assert(piece_is_ok(p)); assert(square_is_ok(to)); - failureCount[p][to]++; + history[p][to] -= int(d) * int(d); + + // Prevent history underflow + if (history[p][to] <= -HistoryMax) + for (int i = 0; i < 16; i++) + for (int j = 0; j < 64; j++) + history[i][j] /= 2; } @@ -91,15 +94,3 @@ int History::move_ordering_score(Piece p, Square to) const { return history[p][to]; } - - -/// History::ok_to_prune() decides whether a move has been sufficiently -/// unsuccessful that it makes sense to prune it entirely. - -bool History::ok_to_prune(Piece p, Square to, Depth d) const { - - assert(piece_is_ok(p)); - assert(square_is_ok(to)); - - return (int(d) * successCount[p][to] < failureCount[p][to]); -}