Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How important is a big hash table? Measurements... (here is my data)

Author: Tom Kerrigan

Date: 11:09:33 03/30/03

Go up one level in this thread


On March 30, 2003 at 10:50:44, Robert Hyatt wrote:

>Now I hope you will choose to dump that "this disproves the hyatt claim"
>stuff, you clearly didn't disprove _anything_...

I was of course referring to:

"The simple rule is that the hash table needs to be at _least_ large enough to
hold the entire tree."

Don't you think the word "need" is a little strong in this situation? I mean,
chess programs work fine without huge hash tables, so maybe they don't "need"
them.

I notice that you didn't present any data on how much of the search tree was
being stored in the hash tables, and without that data you obviously can't point
to a significant performance increase when the entire table is stored, so I
don't see that you even touched on the issue, much less proved it or disproved
it.

-Tom



This page took 0.02 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.