// Stack struct keeps track of the information we need to remember from nodes
// shallower and deeper in the tree during the search. Each search thread has
// its own array of Stack objects, indexed by the current ply.
-
struct Stack {
- Move* pv;
- PieceToHistory* continuationHistory;
- int ply;
- Move currentMove;
- Move excludedMove;
- Move killers[2];
- Value staticEval;
- int statScore;
- int moveCount;
- bool inCheck;
- bool ttPv;
- bool ttHit;
- int doubleExtensions;
- int cutoffCnt;
+ Move* pv;
+ PieceToHistory* continuationHistory;
+ int ply;
+ Move currentMove;
+ Move excludedMove;
+ Move killers[2];
+ Value staticEval;
+ int statScore;
+ int moveCount;
+ bool inCheck;
+ bool ttPv;
+ bool ttHit;
+ int doubleExtensions;
+ int cutoffCnt;
};
// RootMove struct is used for moves at the root of the tree. For each root move
// we store a score and a PV (really a refutation in the case of moves which
// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
-
struct RootMove {
- explicit RootMove(Move m) : pv(1, m) {}
- bool extract_ponder_from_tt(Position& pos);
- bool operator==(const Move& m) const { return pv[0] == m; }
- bool operator<(const RootMove& m) const { // Sort in descending order
- return m.score != score ? m.score < score
- : m.previousScore < previousScore;
- }
-
- Value score = -VALUE_INFINITE;
- Value previousScore = -VALUE_INFINITE;
- Value averageScore = -VALUE_INFINITE;
- Value uciScore = -VALUE_INFINITE;
- bool scoreLowerbound = false;
- bool scoreUpperbound = false;
- int selDepth = 0;
- int tbRank = 0;
- Value tbScore;
- std::vector<Move> pv;
+ explicit RootMove(Move m) :
+ pv(1, m) {}
+ bool extract_ponder_from_tt(Position& pos);
+ bool operator==(const Move& m) const { return pv[0] == m; }
+ // Sort in descending order
+ bool operator<(const RootMove& m) const {
+ return m.score != score ? m.score < score : m.previousScore < previousScore;
+ }
+
+ Value score = -VALUE_INFINITE;
+ Value previousScore = -VALUE_INFINITE;
+ Value averageScore = -VALUE_INFINITE;
+ Value uciScore = -VALUE_INFINITE;
+ bool scoreLowerbound = false;
+ bool scoreUpperbound = false;
+ int selDepth = 0;
+ int tbRank = 0;
+ Value tbScore;
+ std::vector<Move> pv;
};
using RootMoves = std::vector<RootMove>;
struct LimitsType {
- LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC
- time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movetime = TimePoint(0);
- movestogo = depth = mate = perft = infinite = 0;
- nodes = 0;
- }
+ // Init explicitly due to broken value-initialization of non POD in MSVC
+ LimitsType() {
+ time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movetime = TimePoint(0);
+ movestogo = depth = mate = perft = infinite = 0;
+ nodes = 0;
+ }
- bool use_time_management() const {
- return time[WHITE] || time[BLACK];
- }
+ bool use_time_management() const { return time[WHITE] || time[BLACK]; }
- std::vector<Move> searchmoves;
- TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
- int movestogo, depth, mate, perft, infinite;
- int64_t nodes;
+ std::vector<Move> searchmoves;
+ TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
+ int movestogo, depth, mate, perft, infinite;
+ int64_t nodes;
};
extern LimitsType Limits;
void init();
void clear();
-} // namespace Search
+} // namespace Search
-} // namespace Stockfish
+} // namespace Stockfish
-#endif // #ifndef SEARCH_H_INCLUDED
+#endif // #ifndef SEARCH_H_INCLUDED