X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.h;h=8290b41a70f6a49f874df4c64c28341e5614d45f;hb=9b43fd79372946128924ab3d42c64559e95d29d6;hp=e87d0d2c2c33020f4c4b992f19872abe5dde75a1;hpb=fa49311b362a1ab6e4bd5263c7782b19fa59c41f;p=stockfish
diff --git a/src/search.h b/src/search.h
index e87d0d2c..8290b41a 100644
--- a/src/search.h
+++ b/src/search.h
@@ -1,7 +1,7 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
@@ -17,60 +17,66 @@
along with this program. If not, see .
*/
-
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-////
-//// Includes
-////
+#include
+#include
-#include "depth.h"
-#include "move.h"
+#include "types.h"
+class Position;
+struct SplitPoint;
-////
-//// Constants
-////
+namespace Search {
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_MAX = 2;
+/// The Stack 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 Stack objects, indexed by the current ply.
+struct Stack {
+ SplitPoint* sp;
+ int ply;
+ Move currentMove;
+ Move excludedMove;
+ Move bestMove;
+ Move killers[2];
+ Depth reduction;
+ Value eval;
+ Value evalMargin;
+ int skipNullMove;
+};
-////
-//// Types
-////
-/// 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.
+/// The LimitsType 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 SearchStack {
- Move pv[PLY_MAX_PLUS_2];
- Move currentMove;
- Move mateKiller;
- Move threatMove;
- Move killers[KILLER_MAX];
- Depth reduction;
+struct LimitsType {
+
+ LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ bool use_time_management() const { return !(maxTime | maxDepth | maxNodes | infinite); }
- void init(int ply);
- void initKillers();
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
};
-////
-//// Prototypes
-////
+/// The SignalsType struct stores volatile flags updated during the search
+/// typically in an async fashion, for instance to stop the search by the GUI.
+
+struct SignalsType {
+ bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
+};
+
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector SearchMoves;
+extern Position RootPosition;
-extern void init_threads();
-extern void stop_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 init();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
+} // namespace
#endif // !defined(SEARCH_H_INCLUDED)