/*
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-2010 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
const int PLY_MAX = 100;
const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_MAX = 2;
////
/// search thread has its own array of SearchStack objects, indexed by the
/// current ply.
struct EvalInfo;
+struct SplitPoint;
struct SearchStack {
- Move pv[PLY_MAX_PLUS_2];
Move currentMove;
Move mateKiller;
- Move threatMove;
- Move killers[KILLER_MAX];
+ Move excludedMove;
+ Move bestMove;
+ Move killers[2];
Depth reduction;
Value eval;
-
- void init(int ply);
- void initKillers();
+ Value evalMargin;
+ bool skipNullMove;
+ SplitPoint* sp;
};
extern void init_search();
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 exit_threads();
+extern int perft(Position& pos, Depth depth);
+extern bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
+ int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]);
#endif // !defined(SEARCH_H_INCLUDED)