////
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
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();
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];
- Bitboard capSquares;\r
- int capSqValues[64];
bool pvNode;
Depth depth;
int phaseIndex;
int numOfMoves, numOfBadCaptures;
- int movesPicked, badCapturesPicked;
+ int movesPicked;
bool finished;
};
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)