Struct inanis::cache::search::TTable

pub struct TTable {
    pub table: Vec<TTableBucket>,
}

Fields

table: Vec<TTableBucket>

Implementations

impl TTable

pub fn new(size: usize) -> Self

Constructs a new instance of TTable by allocating size bytes of memory.

pub fn add( &self, hash: u64, score: i16, best_move: Move, depth: i8, ply: u16, type: u8, age: u8 )

Adds a new entry (storing the key, score, best_move, depth, ply, r#type and age) using hash to calculate an index of the bucket. Replacement strategy considers a few elements to optimize memory usage and prioritizes slots to replace as follows:

• empty slots or slots with the same key as the new entry
• slots with the smallest depth (if there are some old entries, prioritize them)

This function takes care of converting mate score using passed ply.

pub fn get(&self, hash: u64, ply: u16) -> Option<TTableResult>

Gets a wanted entry using hash to calculate an index of the bucket. This function takes care of converting mate score using passed ply. Returns None if entry does not exists or hash is incompatible with the stored key.

pub fn prefetch(&self, hash: u64)

Prefetches an entry using hash to calculate an index of the bucket. This function should be called early enough, so CPU has enough time to transfer data from the memory into cache.

pub fn get_best_move(&self, hash: u64) -> Option<Move>

Gets an entry’s best move using hash to calculate an index of the bucket. Returns None if entry does not exists or hash is incompatible with the stored key.

pub fn get_pv_line(&self, board: &mut Board, ply: i8) -> Vec<Move>

Retrieves PV line from the transposition table, using board position and the current ply.

pub fn get_usage(&self, resolution: usize) -> f32

Calculates an approximate percentage usage of the table, based on the first resolution entries.

fn get_key(&self, hash: u64) -> u16

Calculates a key for the hash by taking first 16 bits of it.

fn get_index(&self, hash: u64) -> usize

Calculates an index for the hash.