#define MOVEPICK_H_INCLUDED
#include "history.h"
-#include "move.h"
#include "position.h"
+#include "search.h"
#include "types.h"
-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
+/// 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::get_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.
+/// MovePicker::get_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 get a cut-off first.
MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
public:
- MovePicker(const Position&, Move, Depth, const History&, SearchStack*, Value);
- MovePicker(const Position&, Move, Depth, const History&);
+ 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 get_next_move();
private:
const Position& pos;
const History& H;
- Bitboard pinned;
- MoveStack ttMoves[2], killers[2];
- int badCaptureThreshold, phase;
+ Depth depth;
+ Move ttMove;
+ MoveStack killers[2];
+ Square recaptureSquare;
+ int captureThreshold, phase;
const uint8_t* phasePtr;
- MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures;
+ MoveStack *curMove, *lastMove, *lastNonCapture, *badCaptures;
MoveStack moves[MAX_MOVES];
};