X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=900d51fbb3b6d99a8e001a754312d951f2d04c96;hp=5c635478f2fa7d1bdb4010381a06b109fa395694;hb=927f1b0bd30a5b2cfdcdf163f26f528738509064;hpb=37055ad002dfc31eb44ea0e053409f9d6bd25a8d diff --git a/src/search.h b/src/search.h index 5c635478..900d51fb 100644 --- a/src/search.h +++ b/src/search.h @@ -17,30 +17,12 @@ along with this program. If not, see . */ - #if !defined(SEARCH_H_INCLUDED) #define SEARCH_H_INCLUDED -//// -//// Includes -//// - -#include "depth.h" #include "move.h" -#include "value.h" - - -//// -//// Constants -//// +#include "types.h" -const int PLY_MAX = 100; -const int PLY_MAX_PLUS_2 = 102; - - -//// -//// Types -//// /// The SearchStack struct keeps track of the information we need to remember /// from nodes shallower and deeper in the tree during the search. Each @@ -57,21 +39,17 @@ struct SearchStack { Move killers[2]; Depth reduction; Value eval; + Value evalMargin; bool skipNullMove; SplitPoint* sp; }; +class Position; -//// -//// Prototypes -//// - -extern void init_search(); extern void init_threads(); extern void exit_threads(); -extern int perft(Position& pos, Depth depth); -extern int64_t nodes_searched(); -extern bool think(const Position& pos, bool infinite, bool ponder, int time[], int increment[], +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[]); #endif // !defined(SEARCH_H_INCLUDED)