X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=3262c757cbe05aa4ff50e07ad3711ac3ec453aab;hp=3def04eb058f8bdd346cbeaf47281c9c26e3ec26;hb=ed04c010eb4a569532f322f5030d468380b3ab57;hpb=9fc602bae74b8e09bd45ace3b42a8ce84d56b23c

diff --git a/src/search.h b/src/search.h
index 3def04eb..3262c757 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,64 +17,55 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(SEARCH_H_INCLUDED)
 #define SEARCH_H_INCLUDED
 
-////
-//// Includes
-////
-
-#include "depth.h"
 #include "move.h"
-#include "value.h"
-
+#include "types.h"
 
-////
-//// Constants
-////
+#include <vector>
 
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_MAX = 2;
-
-
-////
-//// 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 SearchStack {
-  Move pv[PLY_MAX_PLUS_2];
+  SplitPoint* sp;
+  int ply;
   Move currentMove;
-  Move mateKiller;
-  Move threatMove;
-  Move killers[KILLER_MAX];
+  Move excludedMove;
+  Move bestMove;
+  Move killers[2];
   Depth reduction;
   Value eval;
-
-  void init(int ply);
-  void initKillers();
+  Value evalMargin;
+  int skipNullMove;
 };
 
 
-////
-//// 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.
 
-extern void init_search();
-extern void init_threads();
-extern void exit_threads();
-extern bool think(const Position &pos, bool infinite, bool ponder, int side_to_move,
-                  int time[], int increment[], int movesToGo, int maxDepth,
-                  int maxNodes, int maxTime, Move searchMoves[]);
-extern int perft(Position &pos, Depth depth);
-extern int64_t nodes_searched();
+struct SearchLimits {
+
+  bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+
+  int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
+
+extern SearchLimits Limits;
+extern std::vector<Move> SearchMoves;
+extern Position* RootPosition;
 
+extern void init_search();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
+extern void uci_async_command(const std::string& cmd);
+extern void do_timer_event();
 
 #endif // !defined(SEARCH_H_INCLUDED)