TalkChess.com

[Zlaire]

In Mediocre the hash table consists of one big integer array (int being a 32 bit number in Java).

One transposition table entry requires three slots (move, zobrist key, and flag/depth/eval/etc). But since I use depth/new replacement scheme one index needs 6 slots to hold them both.

So if I were to use 2^20 slots the array would be 2^20*6 slots and take 24mb of memory.

Looking right? (I use a plain int array to store the information rather then objects since creating objects is a major bottleneck in Java)

Now my question is I'm thinking pawn and eval hash would only require two slots per entry each, the eval and the zobrist key, but how many entries should I have compared to the main transposition table? And should I count all the tables when setting the size of the hash tables to say 128mb?