X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=73fa79aea88e6c4adda13665095696d14bb9ec4b;hp=600d7a75198500dfd4582f48e76c239ebb5b2a50;hb=0d68b523a390e2f5c37f211316869d798e852289;hpb=ce063f59cd0fea215309c719ee56cbf486a5ea80 diff --git a/src/search.h b/src/search.h index 600d7a75..73fa79ae 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-2012 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 @@ -38,7 +38,7 @@ namespace Search { /// has its own array of Stack objects, indexed by the current ply. struct Stack { - SplitPoint* sp; + SplitPoint* splitPoint; int ply; Move currentMove; Move excludedMove; @@ -56,12 +56,11 @@ struct Stack { /// all non-pv moves. struct RootMove { - RootMove(){} // Needed by sort() 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; } + 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); @@ -94,6 +93,7 @@ struct SignalsType { }; typedef std::auto_ptr > StateStackPtr; +typedef std::auto_ptr > MovesVectPtr; extern volatile SignalsType Signals; extern LimitsType Limits; @@ -102,6 +102,7 @@ extern Position RootPos; extern Color RootColor; extern Time::point SearchTime; extern StateStackPtr SetupStates; +extern MovesVectPtr SetupMoves; extern void init(); extern size_t perft(Position& pos, Depth depth);