X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=4f98cc762fb041a0dac265a81cc9b1336b401150;hb=6809b57cfc47321826f01253241afef8b4380612;hp=4bb8b0ad1d3ae67bd4466a270c9c4004535f1932;hpb=c81bf3743fa7905d551080ca678a356a0d31a9a9;p=stockfish
diff --git a/src/search.h b/src/search.h
index 4bb8b0ad..4f98cc76 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,62 +17,63 @@
along with this program. If not, see .
*/
-
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-////
-//// Includes
-////
-
-#include "depth.h"
#include "move.h"
-#include "value.h"
-
-
-////
-//// Constants
-////
-
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
+#include "types.h"
+#include
-////
-//// Types
-////
+class Position;
+struct SplitPoint;
/// The SearchStack struct keeps track of the information we need to remember
/// from nodes shallower and deeper in the tree during the search. Each
/// search thread has its own array of SearchStack objects, indexed by the
/// current ply.
-struct EvalInfo;
-struct SplitPoint;
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 LimitsType {
+
+ bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
+
+struct SignalsType {
+ bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
+};
+
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector RootMoves;
+extern Position* RootPosition;
+
+extern void init();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
-////
-//// Prototypes
-////
+}
-extern void init_search();
-extern void init_threads();
-extern void exit_threads();
-extern int perft(Position& pos, Depth depth);
-extern int64_t nodes_searched();
-extern bool think(const Position& pos, bool infinite, bool ponder, int time[], int increment[],
- int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]);
+extern void do_timer_event();
#endif // !defined(SEARCH_H_INCLUDED)