#include <vector>
#include "misc.h"
-#include "position.h"
+#include "movepick.h"
#include "types.h"
+class Position;
+
namespace Search {
/// Stack struct keeps track of the information we need to remember from nodes
struct Stack {
Move* pv;
+ CounterMoveStats* counterMoves;
int ply;
Move currentMove;
Move excludedMove;
Move killers[2];
Value staticEval;
- bool skipEarlyPruning;
+ Value history;
int moveCount;
};
+
/// 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.
bool operator<(const RootMove& m) const { return m.score < score; } // Descending sort
bool operator==(const Move& m) const { return pv[0] == m; }
- void insert_pv_in_tt(Position& pos);
bool extract_ponder_from_tt(Position& pos);
Value score = -VALUE_INFINITE;
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;