Belofte version 2.1.9
A promising chess program using the UCI or Winboard interface
|
#include <search_abfh.h>
Public Member Functions | |
SearchAlphaBetaFH () | |
~SearchAlphaBetaFH () override | |
SearchAlphaBetaFH (SearchAlphaBetaFH const &)=delete | |
SearchAlphaBetaFH (SearchAlphaBetaFH &&)=delete | |
SearchAlphaBetaFH & | operator= (SearchAlphaBetaFH const &)=delete |
SearchAlphaBetaFH & | operator= (SearchAlphaBetaFH &&)=delete |
![]() | |
SearchAlphaBeta () | |
~SearchAlphaBeta () override | |
SearchAlphaBeta (SearchAlphaBeta const &)=delete | |
SearchAlphaBeta (SearchAlphaBeta &&)=delete | |
SearchAlphaBeta & | operator= (SearchAlphaBeta const &)=delete |
SearchAlphaBeta & | operator= (SearchAlphaBeta &&)=delete |
![]() | |
bSearchAlgorithm (std::string const &s) | |
~bSearchAlgorithm () override | |
bSearchAlgorithm (bSearchAlgorithm const &)=delete | |
bSearchAlgorithm (bSearchAlgorithm &&)=delete | |
bSearchAlgorithm & | operator= (bSearchAlgorithm const &)=delete |
bSearchAlgorithm & | operator= (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 & | |
![]() | |
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. | |
![]() | |
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. | |
![]() | |
void | CheckIfAbortingSearch () const |
void | adjustMaxSearchedDepth (depth_t const nDepth) |
constexpr depth_t | getMaxSearchedDepth () const |
void | initMaxSearchedDepth () |
void | setLevel (bLevel *l) |
bLevel * | getLevel () |
void | sendInfoCurrMove (bBoard const &b, depth_t const nCurDepth, bMove const &m, movenum_t const moveid) const |
![]() | |
void | ClockStart () |
void | ClockEnd () |
long long | getDurationSec () const |
long long | getDurationMilliSec () const |
Additional Inherited Members | |
![]() | |
int64_t | m_leafnodes = 0LL |
int64_t | m_nonleafnodes = 0LL |
bool | m_iterativesearch = false |
![]() | |
bScore | m_nBetaCutOffMargin |
Definition at line 13 of file search_abfh.h.
|
inlineexplicit |
Definition at line 15 of file search_abfh.h.
Referenced by operator=(), operator=(), SearchAlphaBetaFH(), and SearchAlphaBetaFH().
|
inlineoverride |
Definition at line 18 of file search_abfh.h.
|
delete |
|
delete |
|
delete |
|
delete |
|
overrideprotectedvirtual |
Intermediate overwriting procedure for algorithm.
b | board |
ml | movelist of this position |
nDepth | depth to search on |
alpha | value |
beta | beta |
Reimplemented from SearchAlphaBeta.
Definition at line 21 of file search_abfh.cpp.
Referenced by CalcBestMove().