|
Belofte version 2.2.0
A promising chess program using the UCI or Winboard interface
|
#include <search_qsonly.h>
Inheritance diagram for SearchEvalPosOnly:
Collaboration diagram for SearchEvalPosOnly:Public Member Functions | |
| SearchEvalPosOnly () | |
| ~SearchEvalPosOnly () override | |
| SearchEvalPosOnly (SearchEvalPosOnly const &)=delete | |
| SearchEvalPosOnly (SearchEvalPosOnly &&)=delete | |
| SearchEvalPosOnly & | operator= (SearchEvalPosOnly const &)=delete |
| SearchEvalPosOnly & | operator= (SearchEvalPosOnly &&)=delete |
Public Member Functions inherited from bSearchAlgorithm | |
| 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, 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 | |
| bScore | CalcBestMove (bBoard &b, bMoveList &ml) override |
| Root search for algorithm. | |
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) |
| bLevel * | getLevel () |
| 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 |
Definition at line 14 of file search_qsonly.h.
|
inlineexplicit |
Definition at line 16 of file search_qsonly.h.
Referenced by operator=(), operator=(), SearchEvalPosOnly(), and SearchEvalPosOnly().
Here is the call graph for this function:
Here is the caller graph for this function:
|
inlineoverride |
Definition at line 19 of file search_qsonly.h.
|
delete |
Here is the call graph for this function:
|
delete |
Here is the call graph for this function:
|
delete |
Here is the call graph for this function:
|
delete |
Here is the call graph for this function:Root search for algorithm.
| b | board |
| ml | movelist of this position |
Implements bSearchAlgorithm.
Definition at line 17 of file search_qsonly.cpp.
Here is the call graph for this function: