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-2012 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 #if !defined(SEARCH_H_INCLUDED)
21 #define SEARCH_H_INCLUDED
33 /// The Stack struct keeps track of the information we need to remember from
34 /// nodes shallower and deeper in the tree during the search. Each search thread
35 /// has its own array of Stack objects, indexed by the current ply.
51 /// RootMove struct is used for moves at the root of the tree. For each root
52 /// move we store a score, a node count, and a PV (really a refutation in the
53 /// case of moves which fail low). Score is normally set at -VALUE_INFINITE for
57 RootMove(){} // Needed by sort()
58 RootMove(Move m) : score(-VALUE_INFINITE), prevScore(-VALUE_INFINITE) {
59 pv.push_back(m); pv.push_back(MOVE_NONE);
62 bool operator<(const RootMove& m) const { return score < m.score; }
63 bool operator==(const Move& m) const { return pv[0] == m; }
65 void extract_pv_from_tt(Position& pos);
66 void insert_pv_in_tt(Position& pos);
74 /// The LimitsType struct stores information sent by GUI about available time
75 /// to search the current move, maximum depth/time, if we are in analysis mode
76 /// or if we have to ponder while is our opponent's side to move.
80 LimitsType() { memset(this, 0, sizeof(LimitsType)); }
81 bool use_time_management() const { return !(maxTime | maxDepth | maxNodes | infinite); }
83 int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
87 /// The SignalsType struct stores volatile flags updated during the search
88 /// typically in an async fashion, for instance to stop the search by the GUI.
91 bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
94 extern volatile SignalsType Signals;
95 extern LimitsType Limits;
96 extern std::vector<RootMove> RootMoves;
97 extern Position RootPosition;
100 extern int64_t perft(Position& pos, Depth depth);
103 } // namespace Search
105 #endif // !defined(SEARCH_H_INCLUDED)