mirror of
https://github.com/official-stockfish/Stockfish.git
synced 2026-07-22 12:47:08 +00:00
Shawn XuandJoost VandeVondele
3f18352396
Passed Non-regression STC: LLR: 2.98 (-2.94,2.94) <-1.75,0.25> Total: 191520 W: 49633 L: 49582 D: 92305 Ptnml(0-2): 557, 20676, 53260, 20693, 574 https://tests.stockfishchess.org/tests/view/68ab570075da51a345a5abe1 Passed Non-regression LTC: LLR: 2.96 (-2.94,2.94) <-1.75,0.25> Total: 212934 W: 54643 L: 54618 D: 103673 Ptnml(0-2): 117, 22417, 61364, 22462, 107 https://tests.stockfishchess.org/tests/view/68ab84e975da51a345a5ac6b 10k Stalemate: Elo: 0.35 ± 1.2 (95%) LOS: 71.6% Total: 10000 W: 4602 L: 4592 D: 806 Ptnml(0-2): 0, 148, 4694, 158, 0 nElo: 1.99 ± 6.8 (95%) PairsRatio: 1.07 https://tests.stockfishchess.org/tests/view/68abeb8175da51a345a5af82 closes https://github.com/official-stockfish/Stockfish/pull/6268 Bench: 2420973
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-2025 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 T>
|
|
ExtMove* score(MoveList<T>&);
|
|
ExtMove* begin() { return cur; }
|
|
ExtMove* end() { return endCur; }
|
|
|
|
const Position& pos;
|
|
const ButterflyHistory* mainHistory;
|
|
const LowPlyHistory* lowPlyHistory;
|
|
const CapturePieceToHistory* captureHistory;
|
|
const PieceToHistory** continuationHistory;
|
|
const PawnHistory* pawnHistory;
|
|
Move ttMove;
|
|
ExtMove * cur, *endCur, *endBadCaptures, *endCaptures, *endGenerated;
|
|
int stage;
|
|
int threshold;
|
|
Depth depth;
|
|
int ply;
|
|
bool skipQuiets = false;
|
|
ExtMove moves[MAX_MOVES];
|
|
};
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef MOVEPICK_H_INCLUDED
|