kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-01 01:03:09 +00:00
Code Issues Releases Wiki Activity

Rename posKey stored in the transposition table

Browse source 
[Edit: Slightly extended by me]

No functional change.
This commit is contained in:
jundery 2013-02-05 10:02:54 -07:00 • committed by Marco Costalba
parent f69c185e02
commit 88c3670edf
2 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
src/tt.cpp
View file

@ -82,23 +82,23 @@ void TranspositionTable::clear() {
/// more valuable than a TTEntry t2 if t1 is from the current search and t2 is from /// more valuable than a TTEntry t2 if t1 is from the current search and t2 is from
/// a previous search, or if the depth of t1 is bigger than the depth of t2. /// a previous search, or if the depth of t1 is bigger than the depth of t2.
void TranspositionTable::store(const Key posKey, Value v, Bound t, Depth d, Move m, Value statV, Value kingD) { void TranspositionTable::store(const Key key, Value v, Bound t, Depth d, Move m, Value statV, Value kingD) {
int c1, c2, c3; int c1, c2, c3;
TTEntry *tte, *replace; TTEntry *tte, *replace;
uint32_t posKey32 = posKey >> 32; // Use the high 32 bits as key inside the cluster uint32_t key32 = key >> 32; // Use the high 32 bits as key inside the cluster
tte = replace = first_entry(posKey); tte = replace = first_entry(key);
for (int i = 0; i < ClusterSize; i++, tte++) for (int i = 0; i < ClusterSize; i++, tte++)
{ {
if (!tte->key() || tte->key() == posKey32) // Empty or overwrite old if (!tte->key() || tte->key() == key32) // Empty or overwrite old
{ {
// Preserve any existing ttMove // Preserve any existing ttMove
if (m == MOVE_NONE) if (m == MOVE_NONE)
m = tte->move(); m = tte->move();
tte->save(posKey32, v, t, d, m, generation, statV, kingD); tte->save(key32, v, t, d, m, generation, statV, kingD);
return; return;
} }
@ -110,7 +110,7 @@ void TranspositionTable::store(const Key posKey, Value v, Bound t, Depth d, Move
if (c1 + c2 + c3 > 0) if (c1 + c2 + c3 > 0)
replace = tte; replace = tte;
} }
replace->save(posKey32, v, t, d, m, generation, statV, kingD); replace->save(key32, v, t, d, m, generation, statV, kingD);
} }
@ -118,13 +118,13 @@ void TranspositionTable::store(const Key posKey, Value v, Bound t, Depth d, Move
/// transposition table. Returns a pointer to the TTEntry or NULL if /// transposition table. Returns a pointer to the TTEntry or NULL if
/// position is not found. /// position is not found.
TTEntry* TranspositionTable::probe(const Key posKey) const { TTEntry* TranspositionTable::probe(const Key key) const {
uint32_t posKey32 = posKey >> 32; TTEntry* tte = first_entry(key);
TTEntry* tte = first_entry(posKey); uint32_t key32 = key >> 32;
for (int i = 0; i < ClusterSize; i++, tte++) for (int i = 0; i < ClusterSize; i++, tte++)
if (tte->key() == posKey32) if (tte->key() == key32)
return tte; return tte;
return NULL; return NULL;

4
src/tt.h
View file

@ -100,8 +100,8 @@ public:
~TranspositionTable(); ~TranspositionTable();
void set_size(size_t mbSize); void set_size(size_t mbSize);
void clear(); void clear();
void store(const Key posKey, Value v, Bound type, Depth d, Move m, Value statV, Value kingD); void store(const Key key, Value v, Bound type, Depth d, Move m, Value statV, Value kingD);
TTEntry* probe(const Key posKey) const; TTEntry* probe(const Key key) const;
void new_search(); void new_search();
TTEntry* first_entry(const Key posKey) const; TTEntry* first_entry(const Key posKey) const;
void refresh(const TTEntry* tte) const; void refresh(const TTEntry* tte) const;