X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=abf7221d8a33bbbe9f22a66db31e4995932d0c3c;hp=d2dc6eba58257f30364baf364fd27b5e35fd546f;hb=bb3427ca85bdb20b4c8af12b63f635d03c5e9146;hpb=adb43cc0cca109c1d95fa8032e717762faa01563

diff --git a/src/search.h b/src/search.h
index d2dc6eba..abf7221d 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,66 +17,64 @@
   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 {
+  SplitPoint* sp;
+  int ply;
   Move currentMove;
-  Move mateKiller;
-  Move threatMove;
   Move excludedMove;
   Move bestMove;
-  Move killers[KILLER_MAX];
+  Move killers[2];
   Depth reduction;
   Value eval;
-  bool skipNullMove;
+  Value evalMargin;
+  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 {
+
+  LimitsType() {  memset(this, 0, sizeof(LimitsType)); }
+  bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+
+  int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
 
-  void init();
-  void initKillers();
+struct SignalsType {
+  bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
 };
 
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector<Move> RootMoves;
+extern Position RootPosition;
 
-////
-//// Prototypes
-////
+extern void init();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
 
-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();
+}
 
+extern void do_timer_event();
 
 #endif // !defined(SEARCH_H_INCLUDED)