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

Remove now unused RootMove.non_pv_score

Browse source 
No functional change

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Joona Kiiski 2011-07-31 15:02:36 +03:00 • committed by Marco Costalba
parent ce24a229df
commit a3c1d64a5f
1 changed files with 5 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
src/search.cpp
View file

@ -52,10 +52,9 @@ namespace {
enum NodeType { Root, PV, NonPV, SplitPointPV, SplitPointNonPV }; enum NodeType { Root, PV, NonPV, SplitPointPV, SplitPointNonPV };
// RootMove struct is used for moves at the root of the tree. For each root // RootMove struct is used for moves at the root of the tree. For each root
// move, we store two scores, a node count, and a PV (really a refutation // move, we store a pv_score, a node count, and a PV (really a refutation
// in the case of moves which fail low). Value pv_score is normally set at // in the case of moves which fail low). Value pv_score is normally set at
// -VALUE_INFINITE for all non-pv moves, while non_pv_score is computed // -VALUE_INFINITE for all non-pv moves.
// according to the order in which moves are returned by MovePicker.
struct RootMove { struct RootMove {
RootMove(); RootMove();
@ -64,20 +63,14 @@ namespace {
// RootMove::operator<() is the comparison function used when // RootMove::operator<() is the comparison function used when
// sorting the moves. A move m1 is considered to be better // sorting the moves. A move m1 is considered to be better
// than a move m2 if it has an higher pv_score, or if it has // than a move m2 if it has an higher pv_score
// equal pv_score but m1 has the higher non_pv_score. In this way bool operator<(const RootMove& m) const { return pv_score < m.pv_score; }
// we are guaranteed that PV moves are always sorted as first.
bool operator<(const RootMove& m) const {
return pv_score != m.pv_score ? pv_score < m.pv_score
: non_pv_score < m.non_pv_score;
}
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; int64_t nodes;
Value pv_score; Value pv_score;
Value non_pv_score;
Move pv[PLY_MAX_PLUS_2]; Move pv[PLY_MAX_PLUS_2];
}; };
@ -2030,7 +2023,7 @@ split_point_start: // At split points actual search starts from here
RootMove::RootMove() { RootMove::RootMove() {
nodes = 0; nodes = 0;
pv_score = non_pv_score = -VALUE_INFINITE; pv_score = -VALUE_INFINITE;
pv[0] = MOVE_NONE; pv[0] = MOVE_NONE;
} }
@ -2044,7 +2037,6 @@ split_point_start: // At split points actual search starts from here
nodes = rm.nodes; nodes = rm.nodes;
pv_score = rm.pv_score; pv_score = rm.pv_score;
non_pv_score = rm.non_pv_score;
return *this; return *this;
} }