X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=694dd643892ba437880f563e15b2b7bd85c2c640;hp=a2a02edac3ed2c63217808aee07c23b459a4abab;hb=e385f194e970f0675bd4c3509bca4a6c81b6df5e;hpb=377d77dbe922b99ee34d686e4fe180698a9b535a diff --git a/src/search.h b/src/search.h index a2a02eda..694dd643 100644 --- a/src/search.h +++ b/src/search.h @@ -31,13 +31,17 @@ class Position; namespace Search { +/// Threshold used for countermoves based pruning +const int CounterMovePruneThreshold = 0; + + /// 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* history; + PieceToHistory* contHistory; int ply; Move currentMove; Move excludedMove; @@ -72,22 +76,22 @@ typedef std::vector RootMoves; /// LimitsType struct stores information sent by GUI about available time to -/// search the current move, maximum depth/time, if we are in analysis mode or -/// if we have to ponder while it's our opponent's turn to move. +/// search the current move, maximum depth/time, or if we are in analysis mode. struct LimitsType { LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = - npmsec = movestogo = depth = movetime = mate = infinite = ponder = 0; + npmsec = movestogo = depth = movetime = mate = perft = infinite = 0; } bool use_time_management() const { - return !(mate | movetime | depth | nodes | infinite); + return !(mate | movetime | depth | nodes | perft | infinite); } std::vector searchmoves; - int time[COLOR_NB], inc[COLOR_NB], npmsec, movestogo, depth, movetime, mate, infinite, ponder; + int time[COLOR_NB], inc[COLOR_NB], npmsec, movestogo, depth, + movetime, mate, perft, infinite; int64_t nodes; TimePoint startTime; }; @@ -96,7 +100,6 @@ extern LimitsType Limits; void init(); void clear(); -template uint64_t perft(Position& pos, Depth depth); } // namespace Search