X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.h;h=d97bb62909c71ceb38ed0affba20216994b99bd2;hp=147d5d0b0a666915031f687a82e0d858f7aad5ce;hb=afae86bfb49471113f14f9f0f56f2a08d052242f;hpb=e9de96f0e417dc706882b645d14dbf41e7ccc467 diff --git a/src/movepick.h b/src/movepick.h index 147d5d0b..d97bb629 100644 --- a/src/movepick.h +++ b/src/movepick.h @@ -1,7 +1,7 @@ /* 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 + Copyright (C) 2008-2010 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 @@ -17,40 +17,15 @@ along with this program. If not, see . */ - #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; -enum MovegenPhase { - PH_TT_MOVES, // Transposition table move and mate killer - PH_GOOD_CAPTURES, // Queen promotions and captures with SEE values >= 0 - PH_KILLERS, // Killer moves from the current ply - PH_NONCAPTURES, // Non-captures and underpromotions - PH_BAD_CAPTURES, // Queen promotions and captures with SEE values < 0 - PH_EVASIONS, // Check evasions - PH_QCAPTURES, // Captures in quiescence search - PH_QCHECKS, // Non-capture checks in quiescence search - PH_STOP -}; - -typedef uint8_t MovegenPhaseT; - /// 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 @@ -64,11 +39,10 @@ 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); + MovePicker(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value beta); + MovePicker(const Position& p, Move ttm, Depth d, const History& h); Move get_next_move(); - Move get_next_move(Lock& lock); - int number_of_moves() const; - Bitboard discovered_check_candidates() const; + int number_of_evasions() const; private: void score_captures(); @@ -78,35 +52,23 @@ private: const Position& pos; const History& H; + Bitboard pinned; MoveStack ttMoves[2], killers[2]; - bool finished; - int numOfBadCaptures, phase; - const MovegenPhaseT* phasePtr; - MoveStack *curMove, *lastMove; - Bitboard dc, pinned; - MoveStack moves[256], badCaptures[64]; + int badCaptureThreshold, phase; + const uint8_t* phasePtr; + MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures; + MoveStack moves[MOVES_MAX]; }; -//// -//// Inline functions -//// - -/// MovePicker::number_of_moves() simply returns the numOfMoves member -/// variable. 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. +/// 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_moves() const { +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)