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

Use probe() as name for looking up into an hash table

Browse Source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2011-04-26 14:10:02 +02:00
parent 321320b081
commit 1d0159075e
6 changed files with 16 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+5 -5
View File
@@ -736,7 +736,7 @@ namespace {
excludedMove = ss->excludedMove;
posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
tte = TT.retrieve(posKey);
tte = TT.probe(posKey);
ttMove = tte ? tte->move() : MOVE_NONE;
// At PV nodes we check for exact scores, while at non-PV nodes we check for
@@ -872,7 +872,7 @@ namespace {
ss->skipNullMove = false;
ttMove = ss->bestMove;
tte = TT.retrieve(posKey);
tte = TT.probe(posKey);
}
split_point_start: // At split points actual search starts from here
@@ -1277,7 +1277,7 @@ split_point_start: // At split points actual search starts from here
// Transposition table lookup. At PV nodes, we don't use the TT for
// pruning, but only for move ordering.
tte = TT.retrieve(pos.get_key());
tte = TT.probe(pos.get_key());
ttMove = (tte ? tte->move() : MOVE_NONE);
if (!PvNode && tte && ok_to_use_TT(tte, ttDepth, beta, ss->ply))
@@ -1987,7 +1987,7 @@ split_point_start: // At split points actual search starts from here
pos.do_move(pv[0], *st++);
while ( (tte = TT.retrieve(pos.get_key())) != NULL
while ( (tte = TT.probe(pos.get_key())) != NULL
&& tte->move() != MOVE_NONE
&& pos.move_is_legal(tte->move())
&& ply < PLY_MAX
@@ -2017,7 +2017,7 @@ split_point_start: // At split points actual search starts from here
do {
k = pos.get_key();
tte = TT.retrieve(k);
tte = TT.probe(k);
// Don't overwrite existing correct entries
if (!tte || tte->move() != pv[ply])