/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2014 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
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-#if !defined(SEARCH_H_INCLUDED)
+#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include <cstring>
#include <memory>
#include <stack>
#include <vector>
namespace Search {
+struct PVEntry {
+ Move pv[MAX_PLY+1];
+
+ void update(Move move, PVEntry* child) {
+ pv[0] = move;
+
+ int i = 1;
+ for (; child && i < MAX_PLY && child->pv[i - 1] != MOVE_NONE; ++i)
+ pv[i] = child->pv[i - 1];
+ pv[i] = MOVE_NONE;
+ }
+};
+
/// The Stack struct keeps track of the information we need to remember from
/// nodes shallower and deeper in the tree during the search. Each search thread
/// has its own array of Stack objects, indexed by the current ply.
struct Stack {
SplitPoint* splitPoint;
+ PVEntry* pv;
int ply;
Move currentMove;
+ Move ttMove;
Move excludedMove;
Move killers[2];
Depth reduction;
Value staticEval;
- Value evalMargin;
- int skipNullMove;
+ bool skipNullMove;
};
bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
bool operator==(const Move& m) const { return pv[0] == m; }
- void extract_pv_from_tt(Position& pos);
void insert_pv_in_tt(Position& pos);
Value score;
/// The 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 is our opponent's side to move.
+/// or if we have to ponder while it's our opponent's turn to move.
struct LimitsType {
- LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ LimitsType() { // Using memset on a std::vector is undefined behavior
+ nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo =
+ depth = movetime = mate = infinite = ponder = 0;
+ }
bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); }
- int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, nodes, movetime, mate, infinite, ponder;
+ std::vector<Move> searchmoves;
+ int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, movetime, mate, infinite, ponder;
+ int64_t nodes;
};
/// The SignalsType struct stores volatile flags updated during the search
-/// typically in an async fashion, for instance to stop the search by the GUI.
+/// typically in an async fashion e.g. to stop the search by the GUI.
struct SignalsType {
- bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
+ bool stop, stopOnPonderhit, firstRootMove, failedLowAtRoot;
};
typedef std::auto_ptr<std::stack<StateInfo> > StateStackPtr;
-typedef std::auto_ptr<std::vector<Move> > MovesVectPtr;
extern volatile SignalsType Signals;
extern LimitsType Limits;
extern std::vector<RootMove> RootMoves;
extern Position RootPos;
-extern Color RootColor;
extern Time::point SearchTime;
extern StateStackPtr SetupStates;
-extern MovesVectPtr SetupMoves;
-extern void init();
-extern size_t perft(Position& pos, Depth depth);
-extern void think();
+void init();
+void think();
+template<bool Root> uint64_t perft(Position& pos, Depth depth);
} // namespace Search
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef SEARCH_H_INCLUDED