X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.h;h=e2a136062c689a79695b4c725719f7c9cb562bdc;hb=11b1a76f35108316ee37d9d7056f4d621305a7ed;hp=4f98cc762fb041a0dac265a81cc9b1336b401150;hpb=c4517c013cf8cf1a388c94d90727dbe08938cc5a;p=stockfish
diff --git a/src/search.h b/src/search.h
index 4f98cc76..e2a13606 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-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2013 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,63 +17,96 @@
along with this program. If not, see .
*/
-#if !defined(SEARCH_H_INCLUDED)
+#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include "move.h"
-#include "types.h"
-
+#include
+#include
+#include
#include
-class Position;
+#include "misc.h"
+#include "position.h"
+#include "types.h"
+
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 {
-struct SearchStack {
- SplitPoint* sp;
+/// 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 Stack {
+ SplitPoint* splitPoint;
int ply;
Move currentMove;
Move excludedMove;
- Move bestMove;
Move killers[2];
Depth reduction;
- Value eval;
+ Value staticEval;
Value evalMargin;
int skipNullMove;
+ int futilityMoveCount;
};
-namespace Search {
-/// The SearchLimits struct stores information sent by GUI about available time
+/// 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), prevScore(-VALUE_INFINITE) {
+ pv.push_back(m); pv.push_back(MOVE_NONE);
+ }
+
+ bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
+ 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 pv;
+};
+
+
+/// 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 LimitsType {
- bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+ LimitsType() { std::memset(this, 0, sizeof(LimitsType)); }
+ bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); }
- int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+ int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, nodes, movetime, mate, infinite, ponder;
};
+
+/// The SignalsType struct stores volatile flags updated during the search
+/// typically in an async fashion, for instance to stop the search by the GUI.
+
struct SignalsType {
bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
};
+typedef std::auto_ptr > StateStackPtr;
+
extern volatile SignalsType Signals;
extern LimitsType Limits;
-extern std::vector RootMoves;
-extern Position* RootPosition;
+extern std::vector RootMoves;
+extern Position RootPos;
+extern Color RootColor;
+extern Time::point SearchTime;
+extern StateStackPtr SetupStates;
extern void init();
-extern int64_t perft(Position& pos, Depth depth);
+extern size_t perft(Position& pos, Depth depth);
extern void think();
-}
-
-extern void do_timer_event();
+} // namespace Search
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef SEARCH_H_INCLUDED