X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=9d3fb4ca355899bb7bcc100aa28b9ce5872c868c;hp=677ad055451299c509f428c205226dfc3a921820;hb=a617b038759f6abd1b33f71ef6d1938fa3588c3d;hpb=d74025a34e7589fcc0ba93b878cd6484108f9088 diff --git a/src/search.h b/src/search.h index 677ad055..9d3fb4ca 100644 --- a/src/search.h +++ b/src/search.h @@ -17,30 +17,14 @@ 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 -//// +const int PLY_MAX_PLUS_2 = PLY_MAX + 2; /// The SearchStack struct keeps track of the information we need to remember /// from nodes shallower and deeper in the tree during the search. Each @@ -62,15 +46,12 @@ struct SearchStack { SplitPoint* sp; }; - -//// -//// Prototypes -//// +class Position; extern void init_search(); extern void init_threads(); extern void exit_threads(); -extern int perft(Position& pos, Depth depth); +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[]);