////
#include "depth.h"
-#include "history.h"
-#include "lock.h"
-#include "movegen.h"
-#include "position.h"
-#include "tt.h"
+#include "move.h"
#include "value.h"
/// 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 {
- Move pv[PLY_MAX];
+ Move pv[PLY_MAX_PLUS_2];
Move currentMove;
Move mateKiller;
Move threatMove;
Move killers[KILLER_MAX];
Depth reduction;
+ Value eval;
+ EvalInfo* evalInfo;
void init(int ply);
void initKillers();
};
-////
-//// Global variables
-////
-
-extern TranspositionTable TT;
-extern int ActiveThreads;
-extern Lock SMPLock;
-
-
////
//// Prototypes
////
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();