2011-11-12 20:44:06 +01:00
|
|
|
/*
|
|
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
2014-05-31 14:23:03 +02:00
|
|
|
Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
#ifndef MOVEPICK_H_INCLUDED
|
2011-11-12 20:44:06 +01:00
|
|
|
#define MOVEPICK_H_INCLUDED
|
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
#include <algorithm> // For std::max
|
2013-08-20 20:02:33 +02:00
|
|
|
#include <cstring> // For std::memset
|
2013-05-03 19:03:42 +02:00
|
|
|
|
|
|
|
#include "movegen.h"
|
2011-11-12 20:44:06 +01:00
|
|
|
#include "position.h"
|
2012-01-01 01:52:19 +01:00
|
|
|
#include "search.h"
|
2011-11-12 20:44:06 +01:00
|
|
|
#include "types.h"
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
/// The Stats struct stores moves statistics. According to the template parameter
|
2013-08-20 20:02:33 +02:00
|
|
|
/// 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
|
2014-05-31 14:23:03 +02:00
|
|
|
/// using only the moving piece and destination square, hence two moves with
|
2013-08-20 20:02:33 +02:00
|
|
|
/// different origin but same destination and piece will be considered identical.
|
|
|
|
template<bool Gain, typename T>
|
2013-05-03 19:03:42 +02:00
|
|
|
struct Stats {
|
|
|
|
|
|
|
|
static const Value Max = Value(2000);
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
const T* operator[](Piece pc) const { return table[pc]; }
|
2013-08-20 20:02:33 +02:00
|
|
|
void clear() { std::memset(table, 0, sizeof(table)); }
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
void update(Piece pc, Square to, Move m) {
|
2013-08-20 20:02:33 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
if (m == table[pc][to].first)
|
2013-08-20 20:02:33 +02:00
|
|
|
return;
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
table[pc][to].second = table[pc][to].first;
|
|
|
|
table[pc][to].first = m;
|
2013-08-20 20:02:33 +02:00
|
|
|
}
|
2013-05-03 19:03:42 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
void update(Piece pc, Square to, Value v) {
|
2013-05-03 19:03:42 +02:00
|
|
|
|
|
|
|
if (Gain)
|
2014-05-31 14:23:03 +02:00
|
|
|
table[pc][to] = std::max(v, table[pc][to] - 1);
|
2013-05-03 19:03:42 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
else if (abs(table[pc][to] + v) < Max)
|
|
|
|
table[pc][to] += v;
|
2013-05-03 19:03:42 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2013-08-20 20:02:33 +02:00
|
|
|
T table[PIECE_NB][SQUARE_NB];
|
2013-05-03 19:03:42 +02:00
|
|
|
};
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
typedef Stats< true, Value> GainsStats;
|
|
|
|
typedef Stats<false, Value> HistoryStats;
|
2014-05-31 14:23:03 +02:00
|
|
|
typedef Stats<false, std::pair<Move, Move> > MovesStats;
|
2013-05-03 19:03:42 +02:00
|
|
|
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
/// 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.
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
class MovePicker {
|
|
|
|
|
|
|
|
MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
|
|
|
|
|
|
|
|
public:
|
2013-08-20 20:02:33 +02:00
|
|
|
MovePicker(const Position&, Move, Depth, const HistoryStats&, Square);
|
|
|
|
MovePicker(const Position&, Move, const HistoryStats&, PieceType);
|
2014-05-31 14:23:03 +02:00
|
|
|
MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Move*, Search::Stack*);
|
2013-08-20 20:02:33 +02:00
|
|
|
|
2012-09-16 17:16:15 +02:00
|
|
|
template<bool SpNode> Move next_move();
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
private:
|
2013-05-03 19:03:42 +02:00
|
|
|
template<GenType> void score();
|
2014-05-31 14:23:03 +02:00
|
|
|
void generate_next_stage();
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
const Position& pos;
|
2013-08-20 20:02:33 +02:00
|
|
|
const HistoryStats& history;
|
2012-09-16 17:16:15 +02:00
|
|
|
Search::Stack* ss;
|
2013-08-20 20:02:33 +02:00
|
|
|
Move* countermoves;
|
2014-05-31 14:23:03 +02:00
|
|
|
Move* followupmoves;
|
2012-01-01 01:52:19 +01:00
|
|
|
Depth depth;
|
|
|
|
Move ttMove;
|
2014-05-31 14:23:03 +02:00
|
|
|
ExtMove killers[6];
|
2012-01-01 01:52:19 +01:00
|
|
|
Square recaptureSquare;
|
2014-05-31 14:23:03 +02:00
|
|
|
Value captureThreshold;
|
|
|
|
int stage;
|
2013-08-20 20:02:33 +02:00
|
|
|
ExtMove *cur, *end, *endQuiets, *endBadCaptures;
|
|
|
|
ExtMove moves[MAX_MOVES];
|
2011-11-12 20:44:06 +01:00
|
|
|
};
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
#endif // #ifndef MOVEPICK_H_INCLUDED
|