X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.h;h=84704b0dc5d5a29ef177cdbbc8ae65951bd6cab0;hb=348f8241041a26cd9458beb8098306099f44a46a;hp=61a33242124f3f68515d4d87a9907af9a5c49a64;hpb=b6ab610e2f3d9148e2a75984800cebc0757b7f01;p=stockfish

diff --git a/src/search.h b/src/search.h
index 61a33242..84704b0d 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,64 +17,65 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(SEARCH_H_INCLUDED)
 #define SEARCH_H_INCLUDED
 
-////
-//// Includes
-////
+#include <cstring>
+#include <vector>
 
-#include "depth.h"
 #include "move.h"
-#include "value.h"
-
-
-////
-//// Constants
-////
-
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_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 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 {
 
-  void init();
-  void initKillers();
+/// 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;
 };
 
+struct SignalsType {
+  bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
+};
+
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector<Move> 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)