along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-#if !defined(SEARCH_H_INCLUDED)
+#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
#include <cstring>
/// has its own array of Stack objects, indexed by the current ply.
struct Stack {
- SplitPoint* sp;
+ SplitPoint* splitPoint;
int ply;
Move currentMove;
Move excludedMove;
Value staticEval;
Value evalMargin;
int skipNullMove;
+ int futilityMoveCount;
};
struct LimitsType {
- LimitsType() { memset(this, 0, sizeof(LimitsType)); }
+ LimitsType() { std::memset(this, 0, sizeof(LimitsType)); }
bool use_time_management() const { return !(mate | movetime | depth | nodes | infinite); }
int time[COLOR_NB], inc[COLOR_NB], movestogo, depth, nodes, movetime, mate, infinite, ponder;
} // namespace Search
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef SEARCH_H_INCLUDED