X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fmovepick.h;h=e0d6ca53ca1b091e875e5b5ac88da0cc153c1f92;hb=a96cba0ec89e5a3bbd435fccca652678c9fd20a7;hp=d7c2e09bbba6fab47d73fec5fb9d52880ad6741c;hpb=bb0da595a731101ec1ead6801da51d06e9f0df85;p=stockfish diff --git a/src/movepick.h b/src/movepick.h index d7c2e09b..e0d6ca53 100644 --- a/src/movepick.h +++ b/src/movepick.h @@ -35,6 +35,7 @@ //// struct EvalInfo; +struct SearchStack; /// 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 @@ -62,13 +63,12 @@ public: PH_STOP }; - MovePicker(const Position& p, bool pvnode, Move ttm, Move mk, Move k1, Move k2, Depth d, EvalInfo* ei = NULL); + MovePicker(const Position& p, bool pvnode, Move ttm, const SearchStack& ss, Depth d, EvalInfo* ei = NULL); Move get_next_move(); Move get_next_move(Lock &lock); int number_of_moves() const; int current_move_score() const; MovegenPhase current_move_type() const; - Bitboard discovered_check_candidates() const; static void init_phase_table(); @@ -79,17 +79,16 @@ private: void score_qcaptures(); Move pick_move_from_list(); int find_best_index(); - int MovePicker::find_best_index(Bitboard* squares, int values[]); + int find_best_index(Bitboard* squares, int values[]); const Position& pos; Move ttMove, mateKiller, killer1, killer2; - Bitboard pinned, dc; MoveStack moves[256], badCaptures[64]; bool pvNode; Depth depth; int phaseIndex; int numOfMoves, numOfBadCaptures; - int movesPicked, badCapturesPicked; + int movesPicked; bool finished; }; @@ -108,12 +107,4 @@ inline int MovePicker::number_of_moves() const { return numOfMoves; } -/// 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)