mirror of
https://github.com/sockspls/badfish
synced 2025-05-01 09:13:08 +00:00
cf71efc34b
It is more clear that only in that case the move number is correct, otherwise is only a partial quantity: the number of moves of that phase. In case of PH_EVASIONS instead we have only one phase. No functional change. Signed-off-by: Marco Costalba <mcostalba@gmail.com>
99 lines
3 KiB
C++
99 lines
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-2009 Marco Costalba
|
|
|
|
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/>.
|
|
*/
|
|
|
|
|
|
#if !defined MOVEPICK_H_INCLUDED
|
|
#define MOVEPICK_H_INCLUDED
|
|
|
|
////
|
|
//// Includes
|
|
////
|
|
|
|
#include "depth.h"
|
|
#include "history.h"
|
|
#include "lock.h"
|
|
#include "position.h"
|
|
|
|
|
|
////
|
|
//// Types
|
|
////
|
|
|
|
struct SearchStack;
|
|
|
|
/// MovePicker is a class which is used to pick one 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::pick_next_move(), which returns a new legal move each time it
|
|
/// is called, until there are no legal 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 be strongest first.
|
|
|
|
class MovePicker {
|
|
|
|
MovePicker& operator=(const MovePicker&); // silence a warning under MSVC
|
|
|
|
public:
|
|
MovePicker(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss = NULL);
|
|
Move get_next_move();
|
|
Move get_next_move(Lock& lock);
|
|
int number_of_evasions() const;
|
|
Bitboard discovered_check_candidates() const;
|
|
|
|
private:
|
|
void score_captures();
|
|
void score_noncaptures();
|
|
void score_evasions();
|
|
void go_next_phase();
|
|
|
|
const Position& pos;
|
|
const History& H;
|
|
MoveStack ttMoves[2], killers[2];
|
|
bool finished;
|
|
int phase;
|
|
const uint8_t* phasePtr;
|
|
MoveStack *curMove, *lastMove, *lastBadCapture;
|
|
Bitboard dc, pinned;
|
|
MoveStack moves[256], badCaptures[64];
|
|
};
|
|
|
|
|
|
////
|
|
//// Inline functions
|
|
////
|
|
|
|
/// MovePicker::number_of_evasions() simply returns the number of moves in
|
|
/// evasions phase. It is intended to be used in positions where the side to
|
|
/// move is in check, for detecting checkmates or situations where there is
|
|
/// only a single reply to check.
|
|
/// WARNING: It works as long as PH_EVASIONS is the _only_ phase for evasions.
|
|
|
|
inline int MovePicker::number_of_evasions() const {
|
|
return int(lastMove - moves);
|
|
}
|
|
|
|
/// MovePicker::discovered_check_candidates() returns a bitboard containing
|
|
/// all pieces which can possibly give discovered check. This bitboard is
|
|
/// computed by the constructor function.
|
|
|
|
inline Bitboard MovePicker::discovered_check_candidates() const {
|
|
return dc;
|
|
}
|
|
|
|
#endif // !defined(MOVEPICK_H_INCLUDED)
|