X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.h;h=ad76085bd86bbf08fae48ea02044a92a16e85dfb;hp=ced0a051654685cbe48fb2c99662d7604de4d38f;hb=9ba7f701ead00fd4a59841d457d15a15d3b84378;hpb=9e4befe3f1ea324bece88aee2e97b38659411c52 diff --git a/src/movepick.h b/src/movepick.h index ced0a051..ad76085b 100644 --- a/src/movepick.h +++ b/src/movepick.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-2009 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,41 +17,15 @@ along with this program. If not, see . */ - #if !defined MOVEPICK_H_INCLUDED #define MOVEPICK_H_INCLUDED -//// -//// Includes -//// - #include "depth.h" #include "history.h" -#include "lock.h" #include "position.h" - -//// -//// Types -//// - struct SearchStack; -enum MovegenPhase { - PH_NULL_MOVE, // Null move - PH_TT_MOVES, // Transposition table move and mate killer - PH_GOOD_CAPTURES, // Queen promotions and captures with SEE values >= 0 - PH_KILLERS, // Killer moves from the current ply - PH_NONCAPTURES, // Non-captures and underpromotions - PH_BAD_CAPTURES, // Queen promotions and captures with SEE values < 0 - PH_EVASIONS, // Check evasions - PH_QCAPTURES, // Captures in quiescence search - PH_QCHECKS, // Non-capture checks in quiescence search - PH_STOP -}; - -typedef uint8_t MovegenPhaseT; - /// MovePicker is a class which is used to pick one legal move at a time from /// the current position. It is initialized with a Position object and a few /// moves we have reason to believe are good. The most important method is @@ -65,11 +39,9 @@ class MovePicker { MovePicker& operator=(const MovePicker&); // silence a warning under MSVC public: - MovePicker(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss = NULL, bool useNullMove = false); + MovePicker(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value beta); + MovePicker(const Position& p, Move ttm, Depth d, const History& h); Move get_next_move(); - Move get_next_move(Lock& lock); - int number_of_moves() const; - Bitboard discovered_check_candidates() const; private: void score_captures(); @@ -79,35 +51,12 @@ private: const Position& pos; const History& H; - Move ttMoves[2], killers[2]; - const MovegenPhaseT* phasePtr; - int phase, movesPicked, numOfBadCaptures; - bool finished; - Bitboard dc, pinned; - MoveStack *curMove, *lastMove; - MoveStack moves[256], badCaptures[64]; + Bitboard pinned; + MoveStack ttMoves[2], killers[2]; + int badCaptureThreshold, phase; + const uint8_t* phasePtr; + MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures; + MoveStack moves[MOVES_MAX]; }; - -//// -//// Inline functions -//// - -/// MovePicker::number_of_moves() simply returns the numOfMoves member -/// variable. It is intended to be used in positions where the side to move -/// is in check, for detecting checkmates or situations where there is only -/// a single reply to check. - -inline int MovePicker::number_of_moves() const { - return int(lastMove - moves); -} - -/// MovePicker::discovered_check_candidates() returns a bitboard containing -/// all pieces which can possibly give discovered check. This bitboard is -/// computed by the constructor function. - -inline Bitboard MovePicker::discovered_check_candidates() const { - return dc; -} - #endif // !defined(MOVEPICK_H_INCLUDED)