Belofte version 2.1.8
A promising chess program using the UCI or Winboard interface
|
#include <search_ab.h>
Public Member Functions | |
SearchAlphaBeta () | |
SearchAlphaBeta (std::string const &) | |
~SearchAlphaBeta () override | |
SearchAlphaBeta (SearchAlphaBeta const &)=delete | |
SearchAlphaBeta (SearchAlphaBeta &&)=delete | |
SearchAlphaBeta & | operator= (SearchAlphaBeta const &)=delete |
SearchAlphaBeta & | operator= (SearchAlphaBeta &&)=delete |
![]() | |
bSearchAlgorithm (std::string const &n) | |
~bSearchAlgorithm () override | |
bSearchAlgorithm (bSearchAlgorithm const &)=delete | |
bSearchAlgorithm (bSearchAlgorithm &&)=delete | |
bSearchAlgorithm & | operator= (bSearchAlgorithm const &)=delete |
bSearchAlgorithm & | operator= (bSearchAlgorithm &&)=delete |
operator std::string () const & | |
int64_t | getNodes () const |
int64_t | getNonLeafNodes () const |
void | StartSearch (bScore const m) |
void | StopSearch () |
void | InterruptSearch () |
bBestMoveInfo | SearchBestMove (bBoard &b) |
Generic search, will call (non-)recursive method per algorithm only when there are moves to be played. | |
bScore | sendInfoSearching (bBoard const &b, depth_t const nDepth, std::string const &c, bScore const sc) const |
bScore | RetrieveBoardEvaluation (bBoard &b) const |
Cache score of board. | |
![]() | |
TimedExecution () | |
implementation of timing functions | |
virtual | ~TimedExecution ()=default |
std::string | getDuration () const |
long long | getDurationMicroSec () const |
Protected Member Functions | |
bScore | CalcBestMove (bBoard &b) final |
virtual bScore | CalcBestMove (bBoard &b, depth_t const nDepth, bSearchScore alpha, bSearchScore beta) |
bScore | Quiescence (bBoard &b, depth_t const nDepth, bSearchScore alpha, bSearchScore beta, uint8_t nCheckCount) |
![]() | |
void | CheckIfAbortingSearch () const |
bScore | attenuateScore (bScore const sc) const |
converge score towards zero in order to force immediate best move first | |
void | setLevel (bLevel *l) |
bLevel * | getLevel () |
void | sendInfoCurrMove (bBoard const &b, depth_t const nDepth, movenum_t const moveid) const |
bScore | sendInfoScore (bBoard const &b, depth_t const nDepth, bScore const) const |
void | dumpMoveList (bBoard &b, depth_t const iDepth) const |
![]() | |
void | ClockStart () |
void | ClockEnd () |
long long | getDurationSec () const |
long long | getDurationMilliSec () const |
Protected Attributes | |
bScore | m_nBetaCutOffMargin |
Additional Inherited Members | |
![]() | |
depth_t | m_maxDepth = 0 |
int64_t | m_nodes = 0LL |
int64_t | m_nonleafnodes = 0LL |
bool | m_iterativesearch = false |
Definition at line 13 of file search_ab.h.
SearchAlphaBeta::SearchAlphaBeta | ( | ) |
Definition at line 35 of file search_ab.cpp.
|
explicit |
Definition at line 42 of file search_ab.cpp.
|
override |
Definition at line 49 of file search_ab.cpp.
|
delete |
|
delete |
|
delete |
|
delete |
Implements bSearchAlgorithm.
Definition at line 53 of file search_ab.cpp.
Referenced by CalcBestMove(), and CalcBestMove().
|
protectedvirtual |
Reimplemented in SearchAlphaBetaFH.
Definition at line 84 of file search_ab.cpp.
|
protected |
Definition at line 216 of file search_ab.cpp.
Referenced by CalcBestMove(), SearchAlphaBetaFH::CalcBestMove(), and Quiescence().
|
protected |
Definition at line 32 of file search_ab.h.
Referenced by CalcBestMove(), SearchAlphaBetaFH::CalcBestMove(), Quiescence(), and SearchAlphaBetaFH::SearchAlphaBetaFH().