Belofte version 2.1.9
A promising chess program using the UCI or Winboard interface
SearchAlphaBetaFH Class Reference

#include <search_abfh.h>

+ Inheritance diagram for SearchAlphaBetaFH:
+ Collaboration diagram for SearchAlphaBetaFH:

Public Member Functions

 SearchAlphaBetaFH ()
 
 ~SearchAlphaBetaFH () override
 
 SearchAlphaBetaFH (SearchAlphaBetaFH const &)=delete
 
 SearchAlphaBetaFH (SearchAlphaBetaFH &&)=delete
 
SearchAlphaBetaFHoperator= (SearchAlphaBetaFH const &)=delete
 
SearchAlphaBetaFHoperator= (SearchAlphaBetaFH &&)=delete
 
- Public Member Functions inherited from SearchAlphaBeta
 SearchAlphaBeta ()
 
 ~SearchAlphaBeta () override
 
 SearchAlphaBeta (SearchAlphaBeta const &)=delete
 
 SearchAlphaBeta (SearchAlphaBeta &&)=delete
 
SearchAlphaBetaoperator= (SearchAlphaBeta const &)=delete
 
SearchAlphaBetaoperator= (SearchAlphaBeta &&)=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=GR_UNSET) const
 Get score of board, eventually from cache.
 
constexpr bool isNoBench () 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

bScore CalcBestMove (bBoard &b, bMoveList &ml, depth_t const nDepth, bSearchScore alpha, bSearchScore beta) override
 Intermediate overwriting procedure for algorithm.
 
- Protected Member Functions inherited from SearchAlphaBeta
 SearchAlphaBeta (std::string const &s)
 
bScore CalcBestMove (bBoard &b, bMoveList &ml) override
 Root search for algorithm.
 
bScore Quiescence (bBoard &b, depth_t const nDepth, bSearchScore alpha, bSearchScore beta, uint8_t nCheckCount)
 Calculate best move from this position considering only non-silent moves.
 
- 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

- Public Attributes inherited from bSearchAlgorithm
int64_t m_leafnodes = 0LL
 
int64_t m_nonleafnodes = 0LL
 
bool m_iterativesearch = false
 
- Protected Attributes inherited from SearchAlphaBeta
bScore m_nBetaCutOffMargin
 

Detailed Description

Definition at line 13 of file search_abfh.h.

Constructor & Destructor Documentation

◆ SearchAlphaBetaFH() [1/3]

SearchAlphaBetaFH::SearchAlphaBetaFH ( )
inlineexplicit

Definition at line 15 of file search_abfh.h.

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

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

◆ ~SearchAlphaBetaFH()

SearchAlphaBetaFH::~SearchAlphaBetaFH ( )
inlineoverride

Definition at line 18 of file search_abfh.h.

◆ SearchAlphaBetaFH() [2/3]

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

◆ SearchAlphaBetaFH() [3/3]

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

Member Function Documentation

◆ operator=() [1/2]

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

◆ operator=() [2/2]

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

◆ CalcBestMove()

bScore SearchAlphaBetaFH::CalcBestMove ( bBoard & b,
bMoveList & ml,
depth_t const nDepth,
bSearchScore alpha,
bSearchScore beta )
overrideprotectedvirtual

Intermediate overwriting procedure for algorithm.

Parameters
bboard
mlmovelist of this position
nDepthdepth to search on
alphavalue
betabeta
Todo
check why not test for winning before evaluating moves

Reimplemented from SearchAlphaBeta.

Definition at line 21 of file search_abfh.cpp.

Referenced by CalcBestMove().

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