mirror of
https://github.com/sockspls/badfish
synced 2025-05-02 01:29:36 +00:00
eed508b444
1/ eval margin and gains removed: 16bit are now free on TT entries, due to the removal of eval margin. may be useful in the future :) gains removed: use instead by Value(128). search() and qsearch() are now consistent in this regard. 2/ futility_margin() linear formula instead of complex (log(depth), movecount) formula. 3/ unify pre & post futility pruning pre futility pruning used depth < 7 plies, while post futility pruning used depth < 4 plies. Now it's always depth < 7. Tested with fixed number of games both at short TC: ELO: 0.82 +-2.1 (95%) LOS: 77.3% Total: 40000 W: 7939 L: 7845 D: 24216 And long TC ELO: 0.59 +-2.0 (95%) LOS: 71.9% Total: 40000 W: 6876 L: 6808 D: 26316 bench 7243575
105 lines
3.3 KiB
C++
105 lines
3.3 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
|
Copyright (C) 2008-2013 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
|
|
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/>.
|
|
*/
|
|
|
|
#ifndef MOVEPICK_H_INCLUDED
|
|
#define MOVEPICK_H_INCLUDED
|
|
|
|
#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 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<typename T>
|
|
struct Stats {
|
|
|
|
static const Value Max = Value(2000);
|
|
|
|
const T* operator[](Piece p) const { return table[p]; }
|
|
void clear() { std::memset(table, 0, sizeof(table)); }
|
|
|
|
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;
|
|
}
|
|
|
|
void update(Piece p, Square to, Value v) {
|
|
|
|
if (abs(table[p][to] + v) < Max)
|
|
table[p][to] += v;
|
|
}
|
|
|
|
private:
|
|
T table[PIECE_NB][SQUARE_NB];
|
|
};
|
|
|
|
typedef Stats<Value> HistoryStats;
|
|
typedef Stats<std::pair<Move, Move> > CountermovesStats;
|
|
|
|
|
|
/// 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 HistoryStats&, Square);
|
|
MovePicker(const Position&, Move, const HistoryStats&, PieceType);
|
|
MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Search::Stack*);
|
|
|
|
template<bool SpNode> Move next_move();
|
|
|
|
private:
|
|
template<GenType> void score();
|
|
void generate_next();
|
|
|
|
const Position& pos;
|
|
const HistoryStats& history;
|
|
Search::Stack* ss;
|
|
Move* countermoves;
|
|
Depth depth;
|
|
Move ttMove;
|
|
ExtMove killers[4];
|
|
Square recaptureSquare;
|
|
int captureThreshold, stage;
|
|
ExtMove *cur, *end, *endQuiets, *endBadCaptures;
|
|
ExtMove moves[MAX_MOVES];
|
|
};
|
|
|
|
#endif // #ifndef MOVEPICK_H_INCLUDED
|