BitBully
0.0.78
A fast, perfect-play Connect-4 engine in modern C++
Loading...
Searching...
No Matches
Class Hierarchy
Go to the graphical class hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level
1
2
]
C
BitBully::BitBully
Perfect-play Connect-4 solver
C
BitBully::Board
Connect-4 position represented as a pair of 64-bit bitboards
C
BitBully::TranspositionTable::Entry
One transposition-table slot
C
BitBully::MoveList
Fixed-capacity priority queue tailored for Connect-4 move ordering
C
GameSolver::Connect4::MoveSorter
This class helps sorting the next moves
C
BitBully::OpeningBook
Sorted in-memory table mapping Huffman-encoded positions to scores
C
GameSolver::Connect4::OpeningBook
C
GameSolver::Connect4::Position
A class storing a Connect 4 position
C
BitBully::Board::RawState
Plain-data snapshot of the board's internal state
C
GameSolver::Connect4::Solver
C
GameSolver::Connect4::TableGetter< key_t, value_t >
Abstrac interface for the Transposition Table get function
C
GameSolver::Connect4::TranspositionTable< partial_key_t, key_t, value_t, log_size >
Transposition Table is a simple hash map with fixed storage size
C
GameSolver::Connect4::TableGetter< Position::position_t, uint8_t >
C
GameSolver::Connect4::TranspositionTable< uint_t< Position::WIDTH *(Position::HEIGHT+1) - TABLE_SIZE >, Position::position_t, uint8_t, TABLE_SIZE >
C
BitBully::TranspositionTable
Power-of-two-sized direct-mapped cache for negamax search results
Generated by
1.16.1