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-2014 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
35 /// The Stack struct keeps track of the information we need to remember from
36 /// nodes shallower and deeper in the tree during the search. Each search thread
37 /// has its own array of Stack objects, indexed by the current ply.
40 SplitPoint* splitPoint;
52 /// RootMove struct is used for moves at the root of the tree. For each root
53 /// move we store a score, a node count, and a PV (really a refutation in the
54 /// case of moves which fail low). Score is normally set at -VALUE_INFINITE for
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; } // Ascending sort
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 it's our opponent's turn to move.
80 LimitsType() { // Using memset on a std::vector is undefined behavior
81 nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = movestogo =
82 depth = movetime = mate = infinite = ponder = 0;
84 bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); }
86 std::vector<Move> searchmoves;
87 int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, movetime, mate, infinite, ponder;
92 /// The SignalsType struct stores volatile flags updated during the search
93 /// typically in an async fashion e.g. to stop the search by the GUI.
96 bool stop, stopOnPonderhit, firstRootMove, failedLowAtRoot;
99 typedef std::auto_ptr<std::stack<StateInfo> > StateStackPtr;
101 extern volatile SignalsType Signals;
102 extern LimitsType Limits;
103 extern std::vector<RootMove> RootMoves;
104 extern Position RootPos;
105 extern Time::point SearchTime;
106 extern StateStackPtr SetupStates;
110 template<bool Root> uint64_t perft(Position& pos, Depth depth);
112 } // namespace Search
114 #endif // #ifndef SEARCH_H_INCLUDED