X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.h;h=44be9636e45974a67b3d6cf47817b87295d6dad0;hp=9aed12e18770d56bbef7b3315ec182d16c4758eb;hb=cb2111f0b62afec5fd977e1dd4ca5843bd006956;hpb=6f6be95bad6f5371d9979de85f7f5892309b7aee

diff --git a/src/movepick.h b/src/movepick.h
index 9aed12e1..44be9636 100644
--- a/src/movepick.h
+++ b/src/movepick.h
@@ -1,7 +1,7 @@
 /*
   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
-  Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
+  Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
 
   Stockfish is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
@@ -17,15 +17,61 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-#if !defined MOVEPICK_H_INCLUDED
+#ifndef MOVEPICK_H_INCLUDED
 #define MOVEPICK_H_INCLUDED
 
-#include "history.h"
+#include <algorithm> // For std::max
+#include <cstring>   // For std::memset
+
+#include "movegen.h"
 #include "position.h"
 #include "search.h"
 #include "types.h"
 
 
+/// The Stats struct stores moves statistics. According to the template parameter
+/// the class can store History, Gains 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. Gains records the move's
+/// best evaluation gain from one ply to the next and is used for pruning decisions.
+/// Countermoves store the move that refute a previous one. Entries are stored
+/// using only the moving piece and destination square, hence two moves with
+/// different origin but same destination and piece will be considered identical.
+template<bool Gain, typename T>
+struct Stats {
+
+  static const Value Max = Value(250);
+
+  const T* operator[](Piece pc) const { return table[pc]; }
+  void clear() { std::memset(table, 0, sizeof(table)); }
+
+  void update(Piece pc, Square to, Move m) {
+
+    if (m == table[pc][to].first)
+        return;
+
+    table[pc][to].second = table[pc][to].first;
+    table[pc][to].first = m;
+  }
+
+  void update(Piece pc, Square to, Value v) {
+
+    if (Gain)
+        table[pc][to] = std::max(v, table[pc][to] - 1);
+
+    else if (abs(table[pc][to] + v) < Max)
+        table[pc][to] +=  v;
+  }
+
+private:
+  T table[PIECE_NB][SQUARE_NB];
+};
+
+typedef Stats< true, Value> GainsStats;
+typedef Stats<false, Value> HistoryStats;
+typedef Stats<false, std::pair<Move, Move> > MovesStats;
+
+
 /// 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,
@@ -34,30 +80,35 @@
 /// to get a cut-off first.
 
 class MovePicker {
+public:
+  MovePicker(const MovePicker&) = delete;
+  MovePicker& operator=(const MovePicker&) = delete;
 
-  MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
+  MovePicker(const Position&, Move, Depth, const HistoryStats&, Square);
+  MovePicker(const Position&, Move, const HistoryStats&, PieceType);
+  MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Move*, Search::Stack*);
 
-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);
-  Move next_move();
+  template<bool SpNode> Move next_move();
 
 private:
-  void score_captures();
-  void score_noncaptures();
-  void score_evasions();
-  void next_phase();
+  template<GenType> void score();
+  void generate_next_stage();
+  ExtMove* begin() { return moves; }
+  ExtMove* end() { return endMoves; }
 
   const Position& pos;
-  const History& H;
+  const HistoryStats& history;
+  Search::Stack* ss;
+  Move* countermoves;
+  Move* followupmoves;
   Depth depth;
   Move ttMove;
-  MoveStack killers[2];
+  ExtMove killers[6];
   Square recaptureSquare;
-  int captureThreshold, phase;
-  MoveStack *curMove, *lastMove, *lastQuiet, *badCaptures;
-  MoveStack moves[MAX_MOVES];
+  Value captureThreshold;
+  int stage;
+  ExtMove *endQuiets, *endBadCaptures;
+  ExtMove moves[MAX_MOVES], *cur = moves, *endMoves = moves;
 };
 
-#endif // !defined(MOVEPICK_H_INCLUDED)
+#endif // #ifndef MOVEPICK_H_INCLUDED