X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=a399beba9a6069ebedeccc619a82f8fbc8457fed;hp=4fe5a5b4f60bfd41a528781f5d0dff74137e607b;hb=4aca11ae2a37df653b54f554a3d8b3005c063447;hpb=a67c22611aea4b643e8278fa6007da316bd06b13 diff --git a/src/search.h b/src/search.h index 4fe5a5b4..a399beba 100644 --- a/src/search.h +++ b/src/search.h @@ -38,6 +38,7 @@ namespace Search { struct Stack { SplitPoint* splitPoint; + Move* pv; int ply; Move currentMove; Move ttMove; @@ -62,7 +63,6 @@ struct RootMove { bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort bool operator==(const Move& m) const { return pv[0] == m; } - void extract_pv_from_tt(Position& pos); void insert_pv_in_tt(Position& pos); Value score; @@ -78,13 +78,14 @@ struct RootMove { struct LimitsType { LimitsType() { // Using memset on a std::vector is undefined behavior - time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo = - depth = nodes = movetime = mate = infinite = ponder = 0; + nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo = + depth = movetime = mate = infinite = ponder = 0; } bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); } std::vector searchmoves; - int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, nodes, movetime, mate, infinite, ponder; + int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, movetime, mate, infinite, ponder; + int64_t nodes; }; @@ -104,8 +105,8 @@ extern Position RootPos; extern Time::point SearchTime; extern StateStackPtr SetupStates; -extern void init(); -extern void think(); +void init(); +void think(); template uint64_t perft(Position& pos, Depth depth); } // namespace Search