#define SEARCH_H_INCLUDED
#include <cstring>
+#include <vector>
#include "move.h"
#include "types.h"
/// current ply.
struct SearchStack {
+ SplitPoint* sp;
int ply;
Move currentMove;
- Move mateKiller;
Move excludedMove;
Move bestMove;
Move killers[2];
Depth reduction;
Value eval;
Value evalMargin;
- bool skipNullMove;
- SplitPoint* sp;
+ int skipNullMove;
};
+namespace Search {
/// The SearchLimits struct stores information sent by GUI about available time
/// to search the current move, maximum depth/time, if we are in analysis mode
/// or if we have to ponder while is our opponent's side to move.
-struct SearchLimits {
+struct LimitsType {
- SearchLimits() { memset(this, 0, sizeof(SearchLimits)); }
+ LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
- SearchLimits(int t, int i, int mtg, int mt, int md, int mn, bool inf, bool pon)
- : time(t), increment(i), movesToGo(mtg), maxTime(mt), maxDepth(md),
- maxNodes(mn), infinite(inf), ponder(pon) {}
-
- bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | int(infinite)); }
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
- int time, increment, movesToGo, maxTime, maxDepth, maxNodes;
- bool infinite, ponder;
+struct SignalsType {
+ bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
};
-extern void init_search();
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector<Move> RootMoves;
+extern Position RootPosition;
+
+extern void init();
extern int64_t perft(Position& pos, Depth depth);
-extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
+extern void think();
+
+}
+
+extern void do_timer_event();
#endif // !defined(SEARCH_H_INCLUDED)