/// 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;
};
: 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)); }
+ bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
- int time, increment, movesToGo, maxTime, maxDepth, maxNodes;
- bool infinite, ponder;
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
};
extern void init_search();
extern int64_t perft(Position& pos, Depth depth);
extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
+extern void do_uci_async_cmd(const std::string& cmd);
+extern void do_timer_event();
#endif // !defined(SEARCH_H_INCLUDED)