/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008 Marco Costalba
+ Copyright (C) 2008-2009 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
struct EvalInfo;
struct SearchStack;
+extern SearchStack EmptySearchStack;
+
/// 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
+/// 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.
/// In order to improve the efficiency of the alpha beta algorithm, MovePicker
class MovePicker {
+ MovePicker& operator=(const MovePicker&); // silence a warning under MSVC
+
public:
enum MovegenPhase {
PH_NONCAPTURES, // Non-captures and underpromotions
PH_EVASIONS, // Check evasions
PH_QCAPTURES, // Captures in quiescence search
- PH_QCHECKS, // Checks in quiescence search
+ PH_QCHECKS, // Non-capture checks in quiescence search
PH_STOP
};
- MovePicker(const Position& p, bool pvnode, Move ttm, const SearchStack& ss, Depth d, EvalInfo* ei = NULL);
+ MovePicker(const Position& p, bool pvnode, Move ttm, const SearchStack& ss, Depth d);
Move get_next_move();
- Move get_next_move(Lock &lock);
+ 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();
void score_evasions();
void score_qcaptures();
Move pick_move_from_list();
- int find_best_index();
- int find_best_index(Bitboard* squares, int values[]);
const Position& pos;
- Move ttMove, mateKiller, killer1, killer2, threatMove;
+ 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;
};
/// 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
+/// all pieces which can possibly give discovered check. This bitboard is
/// computed by the constructor function.
inline Bitboard MovePicker::discovered_check_candidates() const {