/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2012 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
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-#include "move.h"
+#include <cstring>
+#include <vector>
+
+#include "misc.h"
#include "types.h"
class Position;
struct SplitPoint;
-/// The SearchStack 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 SearchStack objects, indexed by the
-/// current ply.
+namespace Search {
+
+/// 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 SearchStack {
+struct Stack {
+ SplitPoint* sp;
int ply;
Move currentMove;
- Move mateKiller;
Move excludedMove;
- Move bestMove;
Move killers[2];
Depth reduction;
Value eval;
Value evalMargin;
- bool skipNullMove;
- SplitPoint* sp;
+ int skipNullMove;
+};
+
+
+/// RootMove struct is used for moves at the root of the tree. For each root
+/// move we store a score, a node count, and a PV (really a refutation in the
+/// case of moves which fail low). Score is normally set at -VALUE_INFINITE for
+/// all non-pv moves.
+struct RootMove {
+
+ RootMove(){} // Needed by sort()
+ RootMove(Move m) : score(-VALUE_INFINITE), prevScore(-VALUE_INFINITE) {
+ pv.push_back(m); pv.push_back(MOVE_NONE);
+ }
+
+ bool operator<(const RootMove& m) const { return score < m.score; }
+ 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;
+ Value prevScore;
+ std::vector<Move> pv;
};
-/// The SearchLimits struct stores information sent by GUI about available time
+/// 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.
-struct SearchLimits {
+struct LimitsType {
+
+ LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ bool use_time_management() const { return !(movetime | depth | nodes | infinite); }
+
+ int time[2], inc[2], movestogo, depth, nodes, movetime, infinite, ponder;
+};
- SearchLimits() {}
- SearchLimits(int t, int i, int mtg, int mt, int md, int mn, bool inf, bool pon)
- : time(t), increment(i), movesToGo(mtg), maxTime(mt), maxDepth(md),
- maxNodes(mn), infinite(inf), ponder(pon) {}
- bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | int(infinite)); }
+/// The SignalsType struct stores volatile flags updated during the search
+/// typically in an async fashion, for instance to stop the search by the GUI.
- int time, increment, movesToGo, maxTime, maxDepth, maxNodes;
- bool infinite, ponder;
+struct SignalsType {
+ bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
};
-extern void init_search();
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector<RootMove> RootMoves;
+extern Position RootPosition;
+extern Time SearchTime;
+
+extern void init();
extern int64_t perft(Position& pos, Depth depth);
-extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
+extern void think();
+
+} // namespace Search
#endif // !defined(SEARCH_H_INCLUDED)