Author: Ulrich Tuerke
Date: 01:44:52 01/08/01
Go up one level in this thread
On January 08, 2001 at 04:07:56, Jouni Uski wrote: >1. I see in Crafty source code, that it has 16 bytes hash key. So 100MB hash >table contains 6 250 000 entries. If Crafty's node speed is 200K this means, >that hash table is enough for only 30s of counting. Correct? Probably not. >But how can we aproximate time for this 100MB hash to fill? > >2. When we have 6 250 000 entries in hash, isn't it taking very long time to >find if position is there?! > >thanks Jouni The hashkey is used to build an index to the table. In ideal case (table not too crowded) you have just one access to find an entry. Uli
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.