mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 12:07:43 +00:00
Carlos Esparza
1f9404434d
Sort evasions before we start returning them in next_move() (just like every other kind of move) instead of looking for the biggest element on every call to next_move(). The bench number changes because the old method is not equivalent to a stable sort. Passed STC: LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 132064 W: 34318 L: 34204 D: 63542 Ptnml(0-2): 392, 15522, 34106, 15604, 408 https://tests.stockfishchess.org/tests/view/6743fee086d5ee47d953f9ca Passed LTC: LLR: 2.94 (-2.94,2.94) <-1.75,0.25> Total: 97542 W: 24899 L: 24757 D: 47886 Ptnml(0-2): 63, 10646, 27193, 10824, 45 https://tests.stockfishchess.org/tests/view/674509cd86d5ee47d953fb96 closes https://github.com/official-stockfish/Stockfish/pull/5700 Bench: 1094825
81 lines
2.8 KiB
C++
81 lines
2.8 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2024 The Stockfish developers (see AUTHORS file)
|
|
|
|
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 "history.h"
|
|
#include "movegen.h"
|
|
#include "types.h"
|
|
|
|
namespace Stockfish {
|
|
|
|
class Position;
|
|
|
|
// The 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 emits one
|
|
// new pseudo-legal move on every call, 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 {
|
|
|
|
public:
|
|
MovePicker(const MovePicker&) = delete;
|
|
MovePicker& operator=(const MovePicker&) = delete;
|
|
MovePicker(const Position&,
|
|
Move,
|
|
Depth,
|
|
const ButterflyHistory*,
|
|
const LowPlyHistory*,
|
|
const CapturePieceToHistory*,
|
|
const PieceToHistory**,
|
|
const PawnHistory*,
|
|
int);
|
|
MovePicker(const Position&, Move, int, const CapturePieceToHistory*);
|
|
Move next_move();
|
|
void skip_quiet_moves();
|
|
|
|
private:
|
|
template<typename Pred>
|
|
Move select(Pred);
|
|
template<GenType>
|
|
void score();
|
|
ExtMove* begin() { return cur; }
|
|
ExtMove* end() { return endMoves; }
|
|
|
|
const Position& pos;
|
|
const ButterflyHistory* mainHistory;
|
|
const LowPlyHistory* lowPlyHistory;
|
|
const CapturePieceToHistory* captureHistory;
|
|
const PieceToHistory** continuationHistory;
|
|
const PawnHistory* pawnHistory;
|
|
Move ttMove;
|
|
ExtMove * cur, *endMoves, *endBadCaptures, *beginBadQuiets, *endBadQuiets;
|
|
int stage;
|
|
int threshold;
|
|
Depth depth;
|
|
int ply;
|
|
bool skipQuiets = false;
|
|
ExtMove moves[MAX_MOVES];
|
|
};
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef MOVEPICK_H_INCLUDED
|