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

Revert TT replacement strategy changes (#380)

Browse source 
It could cause problems with high depths and long time controls

Bench: 8626315

Resolves #390
This commit is contained in:
mstembera 2015-08-08 03:06:32 -07:00 • committed by Joona Kiiski
parent e6310b3469
commit 1aae35b8b7
1 changed files with 6 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
src/tt.cpp
View file

@ -66,9 +66,9 @@ void TranspositionTable::clear() {
/// TranspositionTable::probe() looks up the current position in the transposition /// TranspositionTable::probe() looks up the current position in the transposition
/// table. It returns true and a pointer to the TTEntry if the position is found. /// table. It returns true and a pointer to the TTEntry if the position is found.
/// Otherwise, it returns false and a pointer to an empty or least valuable TTEntry /// Otherwise, it returns false and a pointer to an empty or least valuable TTEntry
/// to be replaced later. TTEntry t1 is considered more valuable than TTEntry t2 if /// to be replaced later. A TTEntry t1 is considered to be more valuable than a
/// both are from the current search and the depth of t1 is greater than the depth of t2, /// TTEntry t2 if t1 is from the current search and t2 is from a previous search,
/// or if t1 is from a previous search but its depth is at least 8 ply deeper than t2. /// or if the depth of t1 is bigger than the depth of t2.
TTEntry* TranspositionTable::probe(const Key key, bool& found) const { TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
@ -87,8 +87,9 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
// Find an entry to be replaced according to the replacement strategy // Find an entry to be replaced according to the replacement strategy
TTEntry* replace = tte; TTEntry* replace = tte;
for (int i = 1; i < ClusterSize; ++i) for (int i = 1; i < ClusterSize; ++i)
if ( (( tte[i].genBound8 & 0xFC) == generation8) * 8 * ONE_PLY + tte[i].depth8 if ( (( tte[i].genBound8 & 0xFC) == generation8)
< ((replace->genBound8 & 0xFC) == generation8) * 8 * ONE_PLY + replace->depth8) - ((replace->genBound8 & 0xFC) == generation8)
- (tte[i].depth8 < replace->depth8) < 0)
replace = &tte[i]; replace = &tte[i];
return found = false, replace; return found = false, replace;