BitBully 0.0.78
A fast, perfect-play Connect-4 engine in modern C++
Loading...
Searching...
No Matches
BitBully::TranspositionTable::Entry Struct Reference

One transposition-table slot. More...

#include <TranspositionTable.h>

Public Types

enum  NodeType { NONE = 0 , EXACT = 1 , LOWER = 2 , UPPER = 3 }
 Type of the bound stored in value. More...

Public Attributes

uint64_t b
 Position UID (see Board::uid()).
NodeType flag {NONE}
 Type of bound stored in value.
int value
 Cached search score.
int8_t searchDepth {0}
 Remaining search budget when the entry was stored.

Detailed Description

One transposition-table slot.

Definition at line 38 of file TranspositionTable.h.

Member Enumeration Documentation

◆ NodeType

Type of the bound stored in value.

Enumerator
NONE 

Empty slot.

EXACT 

Exact score (PV node).

LOWER 

Lower bound (fail-high cut node).

UPPER 

Upper bound (fail-low all node).

Definition at line 42 of file TranspositionTable.h.

Member Data Documentation

◆ b

uint64_t BitBully::TranspositionTable::Entry::b

Position UID (see Board::uid()).

Definition at line 48 of file TranspositionTable.h.

◆ flag

NodeType BitBully::TranspositionTable::Entry::flag {NONE}

Type of bound stored in value.

Definition at line 49 of file TranspositionTable.h.

◆ searchDepth

int8_t BitBully::TranspositionTable::Entry::searchDepth {0}

Remaining search budget when the entry was stored.

INT8_MAX denotes an unlimited (full) search.

Definition at line 56 of file TranspositionTable.h.

◆ value

int BitBully::TranspositionTable::Entry::value

Cached search score.

Definition at line 50 of file TranspositionTable.h.


The documentation for this struct was generated from the following file: