X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=inline;f=src%2Fmovepick.h;h=b9d2594af114e447d987d39ec9edfc12a8cd8955;hb=7b4828b68ced7e92a3399f9e48da8726b6b315f0;hp=fdbd834e43742e63edea39f16cd0bc77a793657f;hpb=4c3a000211bea046dd9506bae748576ecf6368fa;p=stockfish
diff --git a/src/movepick.h b/src/movepick.h
index fdbd834e..b9d2594a 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-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2014 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,47 +17,96 @@
along with this program. If not, see .
*/
-#if !defined MOVEPICK_H_INCLUDED
+#ifndef MOVEPICK_H_INCLUDED
#define MOVEPICK_H_INCLUDED
-#include "history.h"
-#include "move.h"
+#include // For std::max
+#include // For std::memset
+
+#include "movegen.h"
#include "position.h"
+#include "search.h"
#include "types.h"
-struct SearchStack;
-/// 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 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.
+/// 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
+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 HistoryStats;
+typedef Stats > 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,
+/// 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.
class MovePicker {
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&);
- Move get_next_move();
- bool isBadCapture() const;
+ 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*);
+
+ template Move next_move();
private:
- void score_captures();
- void score_noncaptures();
- void score_evasions();
- void go_next_phase();
+ template void score();
+ void generate_next_stage();
const Position& pos;
- const History& H;
- MoveStack ttMoves[2], killers[2];
- int badCaptureThreshold, phase;
- const uint8_t* phasePtr;
- MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures;
- MoveStack moves[MAX_MOVES];
+ const HistoryStats& history;
+ Search::Stack* ss;
+ Move* countermoves;
+ Move* followupmoves;
+ Depth depth;
+ Move ttMove;
+ ExtMove killers[6];
+ Square recaptureSquare;
+ Value captureThreshold;
+ int stage;
+ ExtMove *cur, *end, *endQuiets, *endBadCaptures;
+ ExtMove moves[MAX_MOVES];
};
-#endif // !defined(MOVEPICK_H_INCLUDED)
+#endif // #ifndef MOVEPICK_H_INCLUDED