X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=53e7444c8ad205c5bb6cc34ce22e4b2009621d1f;hb=81cd417b4584b0e3830940c5cb122c898afde08a;hp=91f484a1a344a4d400ef792817f8d2f761df015d;hpb=06a5b602dc32e5dcbb00f32968f1c18004ec93a2;p=stockfish
diff --git a/src/search.h b/src/search.h
index 91f484a1..53e7444c 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-2009 Marco Costalba
+ Copyright (C) 2008-2010 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,30 +17,16 @@
along with this program. If not, see .
*/
-
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-////
-//// Includes
-////
-
-#include "depth.h"
-#include "move.h"
-
+#include
+#include
-////
-//// Constants
-////
+#include "types.h"
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_MAX = 2;
-
-
-////
-//// Types
-////
+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
@@ -48,28 +34,47 @@ const int KILLER_MAX = 2;
/// current ply.
struct SearchStack {
- Move pv[PLY_MAX_PLUS_2];
+ SplitPoint* sp;
+ int ply;
Move currentMove;
- Move mateKiller;
- Move threatMove;
- Move killers[KILLER_MAX];
+ Move excludedMove;
+ Move bestMove;
+ Move killers[2];
Depth reduction;
+ Value eval;
+ Value evalMargin;
+ int skipNullMove;
+};
+
+namespace Search {
+
+/// The SearchLimits 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 {
+
+ LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
+};
- void init(int ply);
- void initKillers();
+struct SignalsType {
+ bool stopOnPonderhit, firstRootMove, stop, failedLowAtRoot;
};
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector RootMoves;
+extern Position RootPosition;
-////
-//// Prototypes
-////
+extern void init();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
-extern void init_threads();
-extern void stop_threads();
-extern bool think(const Position &pos, bool infinite, bool ponder, int side_to_move,
- int time[], int increment[], int movesToGo, int maxDepth,
- int maxNodes, int maxTime, Move searchMoves[]);
-extern int64_t nodes_searched();
+} // namespace
+extern void do_timer_event();
#endif // !defined(SEARCH_H_INCLUDED)