X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=02c209b1646fd4ab92469178a2127ffe30eb9787;hb=ad4739a6d45d9d37afe2414f432a07190fae9b83;hp=0bdabdac6507cf89859eb2d3aec83e4b2264cf09;hpb=539051b1e0fb099c0d0da69d20d6a4c2b98a2cb6;p=stockfish
diff --git a/src/search.h b/src/search.h
index 0bdabdac..02c209b1 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 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,75 +17,66 @@
along with this program. If not, see .
*/
-
#if !defined(SEARCH_H_INCLUDED)
#define SEARCH_H_INCLUDED
-////
-//// Includes
-////
-
-#include "depth.h"
-#include "history.h"
-#include "lock.h"
-#include "movegen.h"
-#include "position.h"
-#include "tt.h"
-#include "value.h"
-
+#include
+#include
-////
-//// Constants
-////
+#include "types.h"
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-const int KILLER_MAX = 2;
+class Position;
+struct SplitPoint;
+namespace Search {
-////
-//// Types
-////
+/// 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.
-/// 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.
-
-struct SearchStack {
- Move pv[PLY_MAX];
+struct Stack {
+ SplitPoint* sp;
+ int ply;
Move currentMove;
- Value currentMoveCaptureValue;
- Move mateKiller;
- Move threatMove;
- Move killers[KILLER_MAX];
+ Move excludedMove;
+ Move bestMove;
+ Move killers[2];
Depth reduction;
+ Value eval;
+ Value evalMargin;
+ int skipNullMove;
};
-////
-//// Global variables
-////
+/// 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.
-extern SearchStack EmptySearchStack;
-extern TranspositionTable TT;
-extern int ActiveThreads;
-extern Lock SMPLock;
+struct LimitsType {
-// Perhaps better to make H local, and pass as parameter to MovePicker?
-extern History H;
+ LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
+ int time, increment, movesToGo, maxTime, maxDepth, maxNodes, 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;
+};
-////
-//// Prototypes
-////
+extern volatile SignalsType Signals;
+extern LimitsType Limits;
+extern std::vector SearchMoves;
+extern Position RootPosition;
-extern void init_threads();
-extern void stop_threads();
-extern void 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();
+extern void init();
+extern int64_t perft(Position& pos, Depth depth);
+extern void think();
+} // namespace
#endif // !defined(SEARCH_H_INCLUDED)