X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=inline;f=src%2Fsearch.h;h=20cfd4741fab7ca35c2e55979e6794eecb373409;hb=62f531254e03f946c92ad307fb68c7faa2806d16;hp=8290b41a70f6a49f874df4c64c28341e5614d45f;hpb=f80c50bcddfd02c1b93dcde067d6a7362dda53a2;p=stockfish
diff --git a/src/search.h b/src/search.h
index 8290b41a..20cfd474 100644
--- a/src/search.h
+++ b/src/search.h
@@ -1,7 +1,7 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2012 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
@@ -17,15 +17,17 @@
along with this program. If not, see .
*/
-#if !defined(SEARCH_H_INCLUDED)
+#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include
+#include
+#include
#include
+#include "misc.h"
+#include "position.h"
#include "types.h"
-class Position;
struct SplitPoint;
namespace Search {
@@ -35,48 +37,77 @@ namespace Search {
/// has its own array of Stack objects, indexed by the current ply.
struct Stack {
- SplitPoint* sp;
+ SplitPoint* splitPoint;
+ Move* pv;
int ply;
Move currentMove;
+ Move ttMove;
Move excludedMove;
- Move bestMove;
Move killers[2];
Depth reduction;
- Value eval;
- Value evalMargin;
- int skipNullMove;
+ Value staticEval;
+ bool skipEarlyPruning;
};
+/// 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(Move m) : score(-VALUE_INFINITE), previousScore(-VALUE_INFINITE), pv(1, m) {}
+
+ bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
+ bool operator==(const Move& m) const { return pv[0] == m; }
+
+ void insert_pv_in_tt(Position& pos);
+
+ Value score;
+ Value previousScore;
+ std::vector pv;
+};
+
+typedef std::vector RootMoveVector;
+
/// 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)); }
- bool use_time_management() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+ 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, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+ std::vector 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 > StateStackPtr;
+
extern volatile SignalsType Signals;
extern LimitsType Limits;
-extern std::vector SearchMoves;
-extern Position RootPosition;
+extern RootMoveVector RootMoves;
+extern Position RootPos;
+extern Time::point SearchTime;
+extern StateStackPtr SetupStates;
-extern void init();
-extern int64_t perft(Position& pos, Depth depth);
-extern void think();
+void init();
+void think();
+template uint64_t perft(Position& pos, Depth depth);
-} // namespace
+} // namespace Search
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef SEARCH_H_INCLUDED