X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.h;h=9d3fb4ca355899bb7bcc100aa28b9ce5872c868c;hb=a617b038759f6abd1b33f71ef6d1938fa3588c3d;hp=22a74bcfd22a9644285e8b7adc811134db3deca7;hpb=55b16593a487f6874a209d995265d7b88860fcd9;p=stockfish

diff --git a/src/search.h b/src/search.h
index 22a74bcf..9d3fb4ca 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,31 +17,15 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(SEARCH_H_INCLUDED)
 #define SEARCH_H_INCLUDED
 
-////
-//// Includes
-////
-
-#include "depth.h"
 #include "move.h"
-#include "value.h"
-
-
-////
-//// Constants
-////
+#include "types.h"
 
 const int PLY_MAX = 100;
 const int PLY_MAX_PLUS_2 = PLY_MAX + 2;
 
-
-////
-//// Types
-////
-
 /// 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
@@ -62,10 +46,7 @@ struct SearchStack {
   SplitPoint* sp;
 };
 
-
-////
-//// Prototypes
-////
+class Position;
 
 extern void init_search();
 extern void init_threads();