#include <vector>
#include "misc.h"
-#include "position.h"
+#include "movepick.h"
#include "types.h"
-template<typename T, bool CM> struct Stats;
-typedef Stats<Value, true> CounterMoveStats;
+class Position;
namespace Search {
Move excludedMove;
Move killers[2];
Value staticEval;
+ Value history;
bool skipEarlyPruning;
int moveCount;
CounterMoveStats* counterMoves;
};
+
/// RootMove struct is used for moves at the root of the tree. For each root move
/// we store a score and a PV (really a refutation in the case of moves which
/// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
typedef std::vector<RootMove> RootMoves;
+
/// 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 it's our opponent's turn to move.
TimePoint startTime;
};
-/// The SignalsType struct stores atomic flags updated during the search
-/// typically in an async fashion e.g. to stop the search by the GUI.
+
+/// SignalsType struct stores atomic flags updated during the search, typically
+/// in an async fashion e.g. to stop the search by the GUI.
struct SignalsType {
std::atomic_bool stop, stopOnPonderhit;