Computer Chess Club Archives

Search

Terms

Messages

Subject: Two (beginner) hash questions

Author: Jouni Uski

Date: 01:07:56 01/08/01

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

Re: Two (beginner) hash questions Robert Hyatt 06:46:47 01/08/01
Re: Two (beginner) hash questions David Rasmussen 04:08:33 01/08/01
Re: Two (beginner) hash questions Dan Newman 03:49:46 01/08/01
Re: Two (beginner) hash questions Ulrich Tuerke 01:44:52 01/08/01

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.