X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=9d3fb4ca355899bb7bcc100aa28b9ce5872c868c;hp=1940c1b52cdf5b8b0c936092ea6ec784def576ae;hb=0fcda095df1caa860e8e3f3a714d5545ec9dc122;hpb=95212222c7444538b84326208e433ac12f15e9fb diff --git a/src/search.h b/src/search.h index 1940c1b5..9d3fb4ca 100644 --- a/src/search.h +++ b/src/search.h @@ -17,31 +17,15 @@ 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 = PLY_MAX + 2; - -//// -//// 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 /// search thread has its own array of SearchStack objects, indexed by the @@ -62,10 +46,6 @@ struct SearchStack { SplitPoint* sp; }; - -//// -//// Prototypes -//// class Position; extern void init_search();