X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.h;h=9f2be29144e82b8b7a1c94d86e64bc4abc98d984;hp=ca052c7bd1901c250f35d0fea3aaf0c5fc422a05;hb=c2d42ea8339b49e52a116e488214a14fda09d413;hpb=bb751d6c890f5c50c642366d601740366cfae8d0 diff --git a/src/movepick.h b/src/movepick.h index ca052c7b..9f2be291 100644 --- a/src/movepick.h +++ b/src/movepick.h @@ -1,89 +1,64 @@ /* - Glaurung, a UCI chess playing engine. - Copyright (C) 2004-2008 Tord Romstad + Stockfish, a UCI chess playing engine derived from Glaurung 2.1 + Copyright (C) 2004-2008 Tord Romstad (Glaurung author) + Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad - Glaurung is free software: you can redistribute it and/or modify + 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. - - Glaurung is distributed in the hope that it will be useful, + + 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 . */ - #if !defined MOVEPICK_H_INCLUDED #define MOVEPICK_H_INCLUDED -//// -//// Includes -//// - -#include "depth.h" -#include "lock.h" +#include "history.h" #include "position.h" - - -//// -//// Types -//// - -/// 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 -/// MovePicker::pick_next_move(), which returns a new legal move each time it -/// is called, until there are no legal moves left, when MOVE_NONE is returned. +#include "search.h" +#include "types.h" + +/// MovePicker is a class which is used to pick one pseudo 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 +/// MovePicker::next_move(), which returns a new pseudo legal move each time +/// it is called, until there are no moves left, when MOVE_NONE is returned. /// In order to improve the efficiency of the alpha beta algorithm, MovePicker -/// attempts to return the moves which are most likely to be strongest first. +/// attempts to return the moves which are most likely to get a cut-off first. class MovePicker { -public: - MovePicker(Position &p, bool pvnode, Move ttm, Move mk, Move k1, Move k2, - Depth dpth); - Move get_next_move(); - Move get_next_move(Lock &lock); - int number_of_moves() const; - int current_move_score() const; - Bitboard discovered_check_candidates(); + MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC - static void init_phase_table(); +public: + MovePicker(const Position&, Move, Depth, const History&, Search::Stack*, Value); + MovePicker(const Position&, Move, Depth, const History&, Square recaptureSq); + MovePicker(const Position&, Move, const History&, PieceType parentCapture); + Move next_move(); private: void score_captures(); void score_noncaptures(); void score_evasions(); - void score_qcaptures(); - Move pick_move_from_list(); - - Position *pos; - Move ttMove, mateKiller, killer1, killer2; - Bitboard pinned, dc; - MoveStack moves[256], badCaptures[64]; - bool pvNode; + void go_next_phase(); + + const Position& pos; + const History& H; Depth depth; - int phaseIndex; - int numOfMoves, numOfBadCaptures; - int movesPicked, badCapturesPicked; - bool finished; + Move ttMove; + MoveStack killers[2]; + Square recaptureSquare; + int captureThreshold, phase; + const uint8_t* phasePtr; + MoveStack *curMove, *lastMove, *lastNonCapture, *badCaptures; + MoveStack moves[MAX_MOVES]; }; - -//// -//// Inline functions -//// - -/// 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() { - return dc; -} - #endif // !defined(MOVEPICK_H_INCLUDED)