X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovepick.h;h=e0d6ca53ca1b091e875e5b5ac88da0cc153c1f92;hb=2f6c5f00e61baa69dd1d241dc88d17bc4296b2bc;hp=cbb69a014dd83373193b6ef0eb68eff5f912a688;hpb=f8bc38a00650c5f4c71aec6f6d5503c7ae4c17a3;p=stockfish diff --git a/src/movepick.h b/src/movepick.h index cbb69a01..e0d6ca53 100644 --- a/src/movepick.h +++ b/src/movepick.h @@ -2,17 +2,17 @@ Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) Copyright (C) 2008 Marco Costalba - + Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. - + Stockfish is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. - + You should have received a copy of the GNU General Public License along with this program. If not, see . */ @@ -34,6 +34,9 @@ //// Types //// +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 /// moves we have reason to believe are good. The most important method is @@ -50,7 +53,7 @@ public: PH_TT_MOVE, // Transposition table move PH_MATE_KILLER, // Mate killer from the current ply PH_GOOD_CAPTURES, // Queen promotions and captures with SEE values >= 0 - PH_BAD_CAPTURES, // Queen promotions and captures with SEE valuse <= 0 + PH_BAD_CAPTURES, // Queen promotions and captures with SEE values < 0 PH_KILLER_1, // Killer move 1 from the current ply (not used yet). PH_KILLER_2, // Killer move 2 from the current ply (not used yet). PH_NONCAPTURES, // Non-captures and underpromotions @@ -60,14 +63,12 @@ public: PH_STOP }; - MovePicker(Position &p, bool pvnode, Move ttm, Move mk, Move k1, Move k2, - Depth dpth); + 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(); @@ -77,16 +78,17 @@ private: void score_evasions(); void score_qcaptures(); Move pick_move_from_list(); - - Position *pos; + int find_best_index(); + 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; }; @@ -105,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)