|
| | BitBully (const std::filesystem::path &bookPath="") |
| bool | isBookLoaded () const |
| void | resetBook () |
| bool | loadBook (const std::filesystem::path &bookPath="") |
| int | mtdf (const Board &b, const int firstGuess, const int maxDepth=-1) noexcept |
| int | nullWindow (const Board &b, const int maxDepth=-1) noexcept |
| void | resetTranspositionTable () |
| auto | getNodeCounter () const |
| void | resetNodeCounter () |
| int | negamax (Board b, int alpha, int beta, const int depth, const int maxDepth=-1) noexcept |
| auto | scoreMove (const Board &b, const int column, const int firstGuess, const int maxDepth=-1) |
| auto | scoreMoves (const Board &b, const int maxDepth=-1) |
Definition at line 14 of file BitBully.h.
◆ BitBully()
| BitBully::BitBully::BitBully |
( |
const std::filesystem::path & | bookPath = "" | ) |
|
|
inlineexplicit |
◆ getNodeCounter()
| auto BitBully::BitBully::getNodeCounter |
( |
| ) |
const |
|
inlinenodiscard |
◆ isBookLoaded()
| bool BitBully::BitBully::isBookLoaded |
( |
| ) |
const |
|
inline |
◆ loadBook()
| bool BitBully::BitBully::loadBook |
( |
const std::filesystem::path & | bookPath = "" | ) |
|
|
inline |
◆ mtdf()
| int BitBully::BitBully::mtdf |
( |
const Board & | b, |
|
|
const int | firstGuess, |
|
|
const int | maxDepth = -1 ) |
|
inlinenoexcept |
◆ negamax()
| int BitBully::BitBully::negamax |
( |
Board | b, |
|
|
int | alpha, |
|
|
int | beta, |
|
|
const int | depth, |
|
|
const int | maxDepth = -1 ) |
|
inlinenoexcept |
◆ nullWindow()
| int BitBully::BitBully::nullWindow |
( |
const Board & | b, |
|
|
const int | maxDepth = -1 ) |
|
inlinenoexcept |
◆ resetBook()
| void BitBully::BitBully::resetBook |
( |
| ) |
|
|
inline |
◆ resetNodeCounter()
| void BitBully::BitBully::resetNodeCounter |
( |
| ) |
|
|
inline |
◆ resetTranspositionTable()
| void BitBully::BitBully::resetTranspositionTable |
( |
| ) |
|
|
inline |
◆ rollout()
| int BitBully::BitBully::rollout |
( |
Board | b | ) |
|
|
inlinestaticnoexcept |
◆ scoreMove()
| auto BitBully::BitBully::scoreMove |
( |
const Board & | b, |
|
|
const int | column, |
|
|
const int | firstGuess, |
|
|
const int | maxDepth = -1 ) |
|
inline |
◆ scoreMoves()
| auto BitBully::BitBully::scoreMoves |
( |
const Board & | b, |
|
|
const int | maxDepth = -1 ) |
|
inline |
◆ scoreToMovesLeft()
| int BitBully::BitBully::scoreToMovesLeft |
( |
const int | score, |
|
|
const Board & | b ) |
|
inlinestaticnoexcept |
Convert a solver score to the number of moves until the game ends.
- Parameters
-
| score | The solver score (positive = current player wins, negative = current player loses, 0 = draw). |
| b | The board state for which the score was computed. |
- Returns
- Number of moves until the game concludes under perfect play.
Definition at line 54 of file BitBully.h.
The documentation for this class was generated from the following file: