Further simplify aspiration code

[stockfish] / src / search.h

diff --git a/src/search.h b/src/search.h
index 53e7444c8ad205c5bb6cc34ce22e4b2009621d1f..02c209b1646fd4ab92469178a2127ffe30eb9787 100644 (file)
--- a/src/search.h
+++ b/src/search.h
@@ -28,12 +28,13 @@
 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;
@@ -46,9 +47,8 @@ struct SearchStack {
   int skipNullMove;
 };
 
-namespace Search {
 
-/// 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.
 
@@ -60,13 +60,17 @@ struct LimitsType {
   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;
 };
 
 extern volatile SignalsType Signals;
 extern LimitsType Limits;
-extern std::vector<Move> RootMoves;
+extern std::vector<Move> SearchMoves;
 extern Position RootPosition;
 
 extern void init();
@@ -75,6 +79,4 @@ extern void think();
 
 } // namespace
 
-extern void do_timer_event();
-
 #endif // !defined(SEARCH_H_INCLUDED)