2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #ifndef SEARCH_H_INCLUDED
21 #define SEARCH_H_INCLUDED
23 #include <memory> // For std::auto_ptr
35 /// Stack struct keeps track of the information we need to remember from nodes
36 /// shallower and deeper in the tree during the search. Each search thread has
37 /// its own array of Stack objects, indexed by the current ply.
40 SplitPoint* splitPoint;
49 bool skipEarlyPruning;
53 /// RootMove struct is used for moves at the root of the tree. For each root move
54 /// we store a score and a PV (really a refutation in the case of moves which
55 /// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
59 explicit RootMove(Move m) : pv(1, m) {}
61 bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
62 bool operator==(const Move& m) const { return pv[0] == m; }
63 void insert_pv_in_tt(Position& pos);
64 bool extract_ponder_from_tt(Position& pos);
66 Value score = -VALUE_INFINITE;
67 Value previousScore = -VALUE_INFINITE;
71 typedef std::vector<RootMove> RootMoveVector;
73 /// LimitsType struct stores information sent by GUI about available time to
74 /// search the current move, maximum depth/time, if we are in analysis mode or
75 /// if we have to ponder while it's our opponent's turn to move.
79 LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC
80 nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movestogo =
81 depth = movetime = mate = infinite = ponder = 0;
84 bool use_time_management() const {
85 return !(mate | movetime | depth | nodes | infinite);
88 std::vector<Move> searchmoves;
89 int time[COLOR_NB], inc[COLOR_NB], npmsec, movestogo, depth, movetime, mate, infinite, ponder;
94 /// The SignalsType struct stores volatile flags updated during the search
95 /// typically in an async fashion e.g. to stop the search by the GUI.
98 bool stop, stopOnPonderhit, firstRootMove, failedLowAtRoot;
101 typedef std::unique_ptr<std::stack<StateInfo>> StateStackPtr;
103 extern volatile SignalsType Signals;
104 extern LimitsType Limits;
105 extern StateStackPtr SetupStates;
109 template<bool Root> uint64_t perft(Position& pos, Depth depth);
111 } // namespace Search
113 #endif // #ifndef SEARCH_H_INCLUDED