X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=955056e1e9d9686d4d6aeccf2cda12fb5436f656;hb=89ec224cb92f49a6edc3d8b03a43d1c4418c285a;hp=b2c876455c7c0c4afcbacdd9d75a43b8bd1c5911;hpb=b01e5fc612b401c83580cc6c1ecd0c62c9592179;p=stockfish
diff --git a/src/search.h b/src/search.h
index b2c87645..955056e1 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,41 +17,25 @@
along with this program. If not, see .
*/
-
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-////
-//// Includes
-////
+#include
-#include "depth.h"
#include "move.h"
-#include "value.h"
-
-
-////
-//// Constants
-////
-
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = PLY_MAX + 2;
+#include "types.h"
-
-////
-//// 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 {
+ int ply;
Move currentMove;
- Move mateKiller;
Move excludedMove;
Move bestMove;
Move killers[2];
@@ -63,15 +47,26 @@ struct SearchStack {
};
-////
-//// Prototypes
-////
+/// 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 {
+
+ SearchLimits() { memset(this, 0, sizeof(SearchLimits)); }
+
+ 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;
+ bool infinite, ponder;
+};
extern void init_search();
-extern void init_threads();
-extern void exit_threads();
-extern int perft(Position& pos, Depth depth);
-extern bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
- int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]);
+extern int64_t perft(Position& pos, Depth depth);
+extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
#endif // !defined(SEARCH_H_INCLUDED)