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

Retire RootMove::nodes

Browse source 
Was used for time management but is no more used
today.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2011-12-30 14:16:15 +01:00
parent 8307da0de7
commit 9d7a36121a
1 changed files with 0 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
src/search.cpp
View file

@ -67,7 +67,6 @@ namespace {
RootMove(){} RootMove(){}
RootMove(Move m) { RootMove(Move m) {
nodes = 0;
score = prevScore = -VALUE_INFINITE; score = prevScore = -VALUE_INFINITE;
pv.push_back(m); pv.push_back(m);
pv.push_back(MOVE_NONE); pv.push_back(MOVE_NONE);
@ -79,7 +78,6 @@ namespace {
void extract_pv_from_tt(Position& pos); void extract_pv_from_tt(Position& pos);
void insert_pv_in_tt(Position& pos); void insert_pv_in_tt(Position& pos);
int64_t nodes;
Value score; Value score;
Value prevScore; Value prevScore;
std::vector<Move> pv; std::vector<Move> pv;
@ -594,7 +592,6 @@ namespace {
assert(pos.thread() >= 0 && pos.thread() < Threads.size()); assert(pos.thread() >= 0 && pos.thread() < Threads.size());
Move movesSearched[MAX_MOVES]; Move movesSearched[MAX_MOVES];
int64_t nodes;
StateInfo st; StateInfo st;
const TTEntry *tte; const TTEntry *tte;
Key posKey; Key posKey;
@ -901,7 +898,6 @@ split_point_start: // At split points actual search starts from here
if (RootNode) if (RootNode)
{ {
Signals.firstRootMove = (moveCount == 1); Signals.firstRootMove = (moveCount == 1);
nodes = pos.nodes_searched();
if (pos.thread() == 0 && elapsed_time() > 2000) if (pos.thread() == 0 && elapsed_time() > 2000)
cout << "info depth " << depth / ONE_PLY cout << "info depth " << depth / ONE_PLY
@ -1068,7 +1064,6 @@ split_point_start: // At split points actual search starts from here
if (RootNode && !Signals.stop) if (RootNode && !Signals.stop)
{ {
RootMove& rm = *find(RootMoves.begin(), RootMoves.end(), move); RootMove& rm = *find(RootMoves.begin(), RootMoves.end(), move);
rm.nodes += pos.nodes_searched() - nodes;
// PV move or new best move ? // PV move or new best move ?
if (isPvMove || value > alpha) if (isPvMove || value > alpha)