#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include <cstring>
#include <memory>
#include <stack>
#include <vector>
Move killers[2];
Depth reduction;
Value staticEval;
- int skipNullMove;
+ bool skipNullMove;
};
struct LimitsType {
- LimitsType() { std::memset(this, 0, sizeof(LimitsType)); }
+ LimitsType() { // Using memset on a std::vector is undefined behavior
+ 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<Move> 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;
};
extern LimitsType Limits;
extern std::vector<RootMove> RootMoves;
extern Position RootPos;
-extern Color RootColor;
extern Time::point SearchTime;
extern StateStackPtr SetupStates;
extern void init();
-extern uint64_t perft(Position& pos, Depth depth);
extern void think();
+template<bool Root> uint64_t perft(Position& pos, Depth depth);
} // namespace Search