X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovepick.h;h=93061ee6fc6a81c8aaf277b817dab41a0d02dd34;hb=eed508b4445057cd26bfb95ab5cd754ac96629fd;hp=3e472fb6d25b83086f9167a5de70aadb9c217d7c;hpb=c5ec94d0f1b128fc2c691c7231663a345409d5cc;p=stockfish
diff --git a/src/movepick.h b/src/movepick.h
index 3e472fb6..93061ee6 100644
--- a/src/movepick.h
+++ b/src/movepick.h
@@ -17,11 +17,11 @@
along with this program. If not, see .
*/
-#if !defined MOVEPICK_H_INCLUDED
+#ifndef MOVEPICK_H_INCLUDED
#define MOVEPICK_H_INCLUDED
#include // For std::max
-#include // For memset
+#include // For std::memset
#include "movegen.h"
#include "position.h"
@@ -30,36 +30,41 @@
/// The Stats struct stores moves statistics. According to the template parameter
-/// the class can store both History and Gains type statistics. History records
-/// how often different moves have been successful or unsuccessful during the
-/// current search and is used for reduction and move ordering decisions. Gains
-/// records the move's best evaluation gain from one ply to the next and is used
-/// for pruning decisions. Entries are stored according only to moving piece and
-/// destination square, in particular two moves with different origin but same
-/// destination and same piece will be considered identical.
-template
+/// the class can store History and Countermoves. History records how often
+/// different moves have been successful or unsuccessful during the current search
+/// and is used for reduction and move ordering decisions.
+/// Countermoves store the move that refute a previous one. Entries are stored
+/// according only to moving piece and destination square, hence two moves with
+/// different origin but same destination and piece will be considered identical.
+template
struct Stats {
static const Value Max = Value(2000);
- const Value* operator[](Piece p) const { return &table[p][0]; }
- void clear() { memset(table, 0, sizeof(table)); }
+ const T* operator[](Piece p) const { return table[p]; }
+ void clear() { std::memset(table, 0, sizeof(table)); }
- void update(Piece p, Square to, Value v) {
+ void update(Piece p, Square to, Move m) {
+
+ if (m == table[p][to].first)
+ return;
+
+ table[p][to].second = table[p][to].first;
+ table[p][to].first = m;
+ }
- if (Gain)
- table[p][to] = std::max(v, table[p][to] - 1);
+ void update(Piece p, Square to, Value v) {
- else if (abs(table[p][to] + v) < Max)
+ if (abs(table[p][to] + v) < Max)
table[p][to] += v;
}
private:
- Value table[PIECE_NB][SQUARE_NB];
+ T table[PIECE_NB][SQUARE_NB];
};
-typedef Stats History;
-typedef Stats Gains;
+typedef Stats HistoryStats;
+typedef Stats > CountermovesStats;
/// MovePicker class is used to pick one pseudo legal move at a time from the
@@ -74,9 +79,10 @@ class MovePicker {
MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
public:
- MovePicker(const Position&, Move, Depth, const History&, Search::Stack*, Value);
- MovePicker(const Position&, Move, Depth, const History&, Square);
- MovePicker(const Position&, Move, const History&, PieceType);
+ MovePicker(const Position&, Move, Depth, const HistoryStats&, Square);
+ MovePicker(const Position&, Move, const HistoryStats&, PieceType);
+ MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Search::Stack*);
+
template Move next_move();
private:
@@ -84,15 +90,16 @@ private:
void generate_next();
const Position& pos;
- const History& Hist;
+ const HistoryStats& history;
Search::Stack* ss;
+ Move* countermoves;
Depth depth;
Move ttMove;
- MoveStack killers[2];
+ ExtMove killers[4];
Square recaptureSquare;
- int captureThreshold, phase;
- MoveStack *cur, *end, *endQuiets, *endBadCaptures;
- MoveStack moves[MAX_MOVES];
+ int captureThreshold, stage;
+ ExtMove *cur, *end, *endQuiets, *endBadCaptures;
+ ExtMove moves[MAX_MOVES];
};
-#endif // !defined(MOVEPICK_H_INCLUDED)
+#endif // #ifndef MOVEPICK_H_INCLUDED