Different move orders can reach the same position. A transposition table (hash map) caches evaluated positions to avoid re-computation.
Uses Zobrist hashing: XOR random numbers for each piece/square.
Without TT: --
With TT: --
TT hits: --