Belofte version 2.2.0
A promising chess program using the UCI or Winboard interface
SearchMiniMax Class Reference

#include <search_mm.h>

+ Inheritance diagram for SearchMiniMax:
+ Collaboration diagram for SearchMiniMax:

Public Member Functions

 SearchMiniMax ()
 
 ~SearchMiniMax () override
 
 SearchMiniMax (SearchMiniMax const &)=delete
 
 SearchMiniMax (SearchMiniMax &&)=delete
 
SearchMiniMaxoperator= (SearchMiniMax const &)=delete
 
SearchMiniMaxoperator= (SearchMiniMax &&)=delete
 
- Public Member Functions inherited from bSearchAlgorithm
 bSearchAlgorithm (std::string const &s)
 
 ~bSearchAlgorithm () override
 
 bSearchAlgorithm (bSearchAlgorithm const &)=delete
 
 bSearchAlgorithm (bSearchAlgorithm &&)=delete
 
bSearchAlgorithmoperator= (bSearchAlgorithm const &)=delete
 
bSearchAlgorithmoperator= (bSearchAlgorithm &&)=delete
 
constexpr int64_t getNodes () const
 
constexpr int64_t getNonLeafNodes () const
 
void StartSearch (bScore const sc)
 
void StopSearch ()
 
void InterruptSearch ()
 
void SearchBestMove (bBoard &b, bMoveList &ml)
 Generic search, will call (non-)recursive method per algorithm only when there are moves to be played.
 
void sendInfoSearching (bBoard const &b, depth_t const nDepth, std::string const &comment) const
 
bScore sendInfoSearching (bBoard const &b, depth_t const nDepth, std::string const &comment, bScore const sc) const
 
bScore RetrieveBoardEvaluation (bBoard &b, gameResult_t const gr, bool const bRecalcFirst) const
 Get score of board, eventually from cache.
 
bScore RetrieveBoardEvaluationForWhite (bBoard &b, gameResult_t const gr, bool const bRecalcFirst) const
 Get score of board, eventually from cache, from whites view.
 
constexpr bool isNoBench () const
 
constexpr bool isBench () const
 
void setBench ()
 
void clearBench ()
 
 operator std::string () const &
 
- Public Member Functions inherited from TimedExecution
 TimedExecution ()
 implementation of timing functions
 
virtual ~TimedExecution ()=default
 
std::string getDuration () const
 
long long getDurationMicroSec () const
 

Protected Member Functions

 SearchMiniMax (std::string const &s)
 
bScore CalcBestMove (bBoard &b, bMoveList &ml) override
 Root search for algorithm.
 
bScore CalcBestMove (bBoard &b, bMoveList &ml, depth_t const nDepth, bScore const minimizing)
 Calculate best move from this position at given depth, iterative call.
 
- Protected Member Functions inherited from bSearchAlgorithm
void CheckIfAbortingSearch () const
 
void adjustMaxSearchedDepth (depth_t const nDepth)
 
constexpr depth_t getMaxSearchedDepth () const
 
void initMaxSearchedDepth ()
 
void setLevel (bLevel *l)
 
bLevelgetLevel ()
 
void sendInfoCurrMove (bBoard const &b, depth_t const nCurDepth, bMove const &m, movenum_t const moveid) const
 
- Protected Member Functions inherited from TimedExecution
void ClockStart ()
 
void ClockEnd ()
 
long long getDurationSec () const
 
long long getDurationMilliSec () const
 

Additional Inherited Members

- Static Public Member Functions inherited from TimedExecution
static void sleep_ms (unsigned long ms)
 Class static function Pause execution for a number of ms.
 
- Public Attributes inherited from bSearchAlgorithm
int64_t m_leafnodes = 0LL
 
int64_t m_nonleafnodes = 0LL
 
bool m_iterativesearch = false
 

Detailed Description

Definition at line 13 of file search_mm.h.

Constructor & Destructor Documentation

◆ SearchMiniMax() [1/4]

SearchMiniMax::SearchMiniMax ( std::string const & s)
inlineexplicitprotected

Definition at line 15 of file search_mm.h.

Referenced by operator=(), operator=(), SearchMiniMax(), and SearchMiniMax().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ SearchMiniMax() [2/4]

SearchMiniMax::SearchMiniMax ( )
inlineexplicit

Definition at line 20 of file search_mm.h.

+ Here is the call graph for this function:

◆ ~SearchMiniMax()

SearchMiniMax::~SearchMiniMax ( )
inlineoverride

Definition at line 23 of file search_mm.h.

◆ SearchMiniMax() [3/4]

SearchMiniMax::SearchMiniMax ( SearchMiniMax const & )
delete
+ Here is the call graph for this function:

◆ SearchMiniMax() [4/4]

SearchMiniMax::SearchMiniMax ( SearchMiniMax && )
delete
+ Here is the call graph for this function:

Member Function Documentation

◆ operator=() [1/2]

SearchMiniMax & SearchMiniMax::operator= ( SearchMiniMax const & )
delete
+ Here is the call graph for this function:

◆ operator=() [2/2]

SearchMiniMax & SearchMiniMax::operator= ( SearchMiniMax && )
delete
+ Here is the call graph for this function:

◆ CalcBestMove() [1/2]

bScore SearchMiniMax::CalcBestMove ( bBoard & b,
bMoveList & ml )
overrideprotectedvirtual

Root search for algorithm.

Parameters
bboard
mlmovelist of this position

Implements bSearchAlgorithm.

Definition at line 17 of file search_mm.cpp.

Referenced by CalcBestMove(), and CalcBestMove().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ CalcBestMove() [2/2]

bScore SearchMiniMax::CalcBestMove ( bBoard & b,
bMoveList & ml,
depth_t const nDepth,
bScore const minimizing )
protected

Calculate best move from this position at given depth, iterative call.

Parameters
bBoard
mlmovelist of this position
nDepthdepth to search for, increasing until searchDepth
minimizingsearch from minimizing view

Definition at line 34 of file search_mm.cpp.

+ Here is the call graph for this function: