#include "move.h"
#include "types.h"
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = PLY_MAX + 2;
/// The SearchStack struct keeps track of the information we need to remember
/// from nodes shallower and deeper in the tree during the search. Each
struct SplitPoint;
struct SearchStack {
+ int ply;
Move currentMove;
Move mateKiller;
Move excludedMove;
class Position;
-extern void init_search();
extern void init_threads();
extern void exit_threads();
extern int64_t perft(Position& pos, Depth depth);