|
BenBot 1.7.5
A chess engine
|
#include <libbenbot/search/Bounds.hpp>
Public Member Functions | |
| constexpr auto | contains (Score score) const noexcept -> bool |
| constexpr auto | invert () const noexcept -> Bounds |
| constexpr auto | mate_distance_pruning (size_t plyFromRoot) noexcept -> std::optional< Score > |
| constexpr auto | null_window () const noexcept -> Bounds |
Public Attributes | |
| Score | alpha { -eval::MAX } |
| Score | beta { eval::MAX } |
This struct encapsulates a search's alpha and beta bounds values. This struct is mostly for internal usage by the search context class.
Definition at line 36 of file Bounds.hpp.
|
nodiscardconstexprnoexcept |
Returns true if the score is between alpha and beta.
Definition at line 97 of file Bounds.hpp.
|
nodiscardconstexprnoexcept |
Returns an inverted copy of these bounds, suitable for swapping the player perspectives.
Definition at line 81 of file Bounds.hpp.
|
nodiscardconstexprnoexcept |
Performs mate distance pruning. If an MDP cutoff is available, returns the cutoff value (and the search may return early). If no MDP cutoff is available, this method returns nullopt and the search should continue.
Definition at line 102 of file Bounds.hpp.
|
nodiscardconstexprnoexcept |
Returns a null window around alpha. For usage with principal variation search.
Definition at line 89 of file Bounds.hpp.
The search's alpha bound.
Definition at line 38 of file Bounds.hpp.
The search's beta bound.
Definition at line 41 of file Bounds.hpp.