|
io-chess
UCI chess engine
|
Transposition Table (TT) implementation. More...
#include "TT.h"#include "../Types.h"#include <algorithm>#include <array>#include <cstdint>#include <cstring>#include <fstream>#include <iostream>
Transposition Table (TT) implementation.
A lock-less, aging-based hash table that caches previously evaluated positions to dramatically reduce the search tree size. Includes methods for saving, probing, and prefetching.