#include "movegen.h"
#include "position.h"
-#include "search.h"
#include "types.h"
const T* operator[](Piece pc) const { return table[pc]; }
T* operator[](Piece pc) { return table[pc]; }
void clear() { std::memset(table, 0, sizeof(table)); }
-
void update(Piece pc, Square to, Move m) { table[pc][to] = m; }
-
void update(Piece pc, Square to, Value v) {
if (abs(int(v)) >= 324)
struct FromToStats {
- Value get(Color c, Move m) const { return table[c][from_sq(m)][to_sq(m)]; }
- void clear() { std::memset(table, 0, sizeof(table)); }
+ Value get(Color c, Move m) const { return table[c][from_sq(m)][to_sq(m)]; }
+ void clear() { std::memset(table, 0, sizeof(table)); }
+ void update(Color c, Move m, Value v) {
- void update(Color c, Move m, Value v)
- {
- if (abs(int(v)) >= 324)
- return;
+ if (abs(int(v)) >= 324)
+ return;
- Square f = from_sq(m);
- Square t = to_sq(m);
+ Square from = from_sq(m);
+ Square to = to_sq(m);
- table[c][f][t] -= table[c][f][t] * abs(int(v)) / 324;
- table[c][f][t] += int(v) * 32;
- }
+ table[c][from][to] -= table[c][from][to] * abs(int(v)) / 324;
+ table[c][from][to] += int(v) * 32;
+ }
private:
- Value table[COLOR_NB][SQUARE_NB][SQUARE_NB];
+ Value table[COLOR_NB][SQUARE_NB][SQUARE_NB];
};
+
/// MovePicker class is used to pick one pseudo legal move at a time from the
/// current position. The most important method is 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.
+namespace Search { struct Stack; }
class MovePicker {
public:
MovePicker(const Position&, Move, Depth, Search::Stack*);
Move next_move();
- int see_sign() const;
private:
template<GenType> void score();
Square recaptureSquare;
Value threshold;
int stage;
- ExtMove* cur, *endMoves, *endBadCaptures;
+ ExtMove *cur, *endMoves, *endBadCaptures;
ExtMove moves[MAX_MOVES];
};