Author: Steven Edwards
Date: 08:35:07 09/24/03
Go up one level in this thread
On September 24, 2003 at 11:20:13, William Penn wrote: >For example, is 512MB hash table size really better than 513MB (512+1), or >better than 528MB (512+16)? > >Another example, is 768MB (3x256) better than 784MB (3x256+16)? It is most common for a transposition table to have a count of *entries* that is an integral power of two. This is because of the traditional use of masking hash signature bits to return a table index. A transposition table entry itself does not have to have a size in bytes that is an integral power of two. If the size is a power of two, that helps with table entry address calculation as a left shift can be used in place of a multiplication. In the Old Days, that was a big improvement. It's not so important today with fast integer multiplication.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.