////
#include <cassert>
-#include <cmath>
#include <cstring>
+#include "evaluate.h"
#include "movegen.h"
#include "tt.h"
TranspositionTable::TranspositionTable() {
- size = overwrites = 0;
+ size = 0;
entries = 0;
generation = 0;
}
<< " MB for transposition table." << std::endl;
Application::exit_with_failure();
}
- clear();
}
}
replace = tte;
}
replace->save(posKey32, v, t, d, m, generation, statV, kingD);
- overwrites++;
}
/// entries from the current search.
void TranspositionTable::new_search() {
-
generation++;
- overwrites = 0;
}
void TranspositionTable::insert_pv(const Position& pos, Move pv[]) {
StateInfo st;
+ EvalInfo ei;
+ Value v;
Position p(pos, pos.thread());
for (int i = 0; pv[i] != MOVE_NONE; i++)
{
TTEntry *tte = retrieve(p.get_key());
if (!tte || tte->move() != pv[i])
- store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, Depth(-127*OnePly), pv[i], VALUE_NONE, VALUE_NONE);
+ {
+ v = (p.is_check() ? VALUE_NONE : evaluate(p, ei));
+ store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, Depth(-127*OnePly), pv[i], v, ei.kingDanger[pos.side_to_move()]);
+ }
p.do_move(pv[i], st);
}
}
-/// TranspositionTable::extract_pv() extends a PV by adding moves from the
-/// transposition table at the end. This should ensure that the PV is almost
-/// always at least two plies long, which is important, because otherwise we
-/// will often get single-move PVs when the search stops while failing high,
-/// and a single-move PV means that we don't have a ponder move.
+/// TranspositionTable::extract_pv() builds a PV by adding moves from the
+/// transposition table. We consider also failing high nodes and not only
+/// VALUE_TYPE_EXACT nodes. This allow to always have a ponder move even
+/// when we fail high at root and also a long PV to print that is important
+/// for position analysis.
void TranspositionTable::extract_pv(const Position& pos, Move bestMove, Move pv[], const int PLY_MAX) {
pv[ply] = bestMove;
p.do_move(pv[ply++], st);
- // Extract moves from TT when possible. We try hard to always
- // get a ponder move, that's the reason of ply < 2 conditions.
while ( (tte = retrieve(p.get_key())) != NULL
&& tte->move() != MOVE_NONE
- && (tte->type() == VALUE_TYPE_EXACT || ply < 2)
&& move_is_legal(p, tte->move())
&& (!p.is_draw() || ply < 2)
&& ply < PLY_MAX)
}
pv[ply] = MOVE_NONE;
}
-
-
-/// TranspositionTable::full() returns the permill of all transposition table
-/// entries which have received at least one overwrite during the current search.
-/// It is used to display the "info hashfull ..." information in UCI.
-
-int TranspositionTable::full() const {
-
- double N = double(size) * ClusterSize;
- return int(1000 * (1 - exp(overwrites * log(1.0 - 1.0/N))));
-}