/*
- 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 Marco Costalba
- 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 <http://www.gnu.org/licenses/>.
*/
//// 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
class MovePicker {
+ MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
+
public:
- MovePicker(Position &p, bool pvnode, Move ttm, Move mk, Move k1, Move k2,
- Depth dpth);
+
+ enum MovegenPhase {
+ 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 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
+ PH_EVASIONS, // Check evasions
+ PH_QCAPTURES, // Captures in quiescence search
+ PH_QCHECKS, // Checks in quiescence search
+ PH_STOP
+ };
+
+ MovePicker(const Position& p, bool pvnode, Move ttm, const SearchStack& ss, Depth d);
Move get_next_move();
Move get_next_move(Lock &lock);
int number_of_moves() const;
int current_move_score() const;
- Bitboard discovered_check_candidates();
+ MovegenPhase current_move_type() const;
+ Bitboard discovered_check_candidates() const;
static void init_phase_table();
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];
Depth depth;
int phaseIndex;
int numOfMoves, numOfBadCaptures;
- int movesPicked, badCapturesPicked;
+ int movesPicked;
bool finished;
};
//// 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 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() {
+inline Bitboard MovePicker::discovered_check_candidates() const {
return dc;
}