X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=53e7444c8ad205c5bb6cc34ce22e4b2009621d1f;hb=81cd417b4584b0e3830940c5cb122c898afde08a;hp=1b17254a84b70362230c493db08f3a9ab315f106;hpb=408fdcc93f4294a649e9df550d9ca483a38dc73a;p=stockfish diff --git a/src/search.h b/src/search.h index 1b17254a..53e7444c 100644 --- a/src/search.h +++ b/src/search.h @@ -20,37 +20,61 @@ #if !defined(SEARCH_H_INCLUDED) #define SEARCH_H_INCLUDED -#include "move.h" +#include +#include + #include "types.h" +class Position; +struct SplitPoint; /// The SearchStack 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 SearchStack objects, indexed by the /// current ply. -struct EvalInfo; -struct SplitPoint; struct SearchStack { + SplitPoint* sp; + int ply; Move currentMove; - Move mateKiller; Move excludedMove; Move bestMove; Move killers[2]; Depth reduction; Value eval; Value evalMargin; - bool skipNullMove; - SplitPoint* sp; + int skipNullMove; }; -class Position; +namespace Search { + +/// The SearchLimits 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 is our opponent's side to move. + +struct LimitsType { -extern void init_search(); -extern void init_threads(); -extern void exit_threads(); + LimitsType() { memset(this, 0, sizeof(LimitsType)); } + bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); } + + int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder; +}; + +struct SignalsType { + bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot; +}; + +extern volatile SignalsType Signals; +extern LimitsType Limits; +extern std::vector RootMoves; +extern Position RootPosition; + +extern void init(); extern int64_t perft(Position& pos, Depth depth); -extern bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[], - int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]); +extern void think(); + +} // namespace + +extern void do_timer_event(); #endif // !defined(SEARCH_H_INCLUDED)