SplitPoint* splitPoint;
int ply;
Move currentMove;
+ Move ttMove;
Move excludedMove;
Move killers[2];
Depth reduction;
LimitsType() { std::memset(this, 0, sizeof(LimitsType)); }
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;
};
/// typically in an async fashion e.g. to stop the search by the GUI.
struct SignalsType {
- bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
+ bool stop, stopOnPonderhit, firstRootMove, failedLowAtRoot;
};
typedef std::auto_ptr<std::stack<StateInfo> > StateStackPtr;
extern std::vector<RootMove> RootMoves;
extern Position RootPos;
extern Color RootColor;
-extern Time::point SearchTime, IterationTime;
+extern Time::point SearchTime;
extern StateStackPtr SetupStates;
extern void init();
-extern size_t perft(Position& pos, Depth depth);
+extern uint64_t perft(Position& pos, Depth depth);
extern void think();
} // namespace Search