Computer Chess Club Archives

Search

Messages

Subject: Re: How much advantage give hash table?

Author: Bas Hamstra

Date: 19:09:38 09/11/99

Go up one level in this thread

HashTables are very important for movesorting. Best moves from previous searches
are in the hashtable. That way you can very much improve the probability that
you play the best move first, which is immensely important for the alpha-beta
scheme. When you search to ply n with hashtables you have to examine less nodes
than without, because of that.

Estimates of how much less vary from 20% to 50%. In case of 50%, assuming using
nullmove, yes that is almost a ply.


Regards,
Bas Hamstra.








On September 11, 1999 at 21:35:49, Oliver Roese wrote:

>On September 11, 1999 at 21:30:42, leonid wrote:
>
>>How much additional advantage in speed can I expect after igniting the
>>hash table?
>
>As Dr. Hyatt has said, hash tables gives an additional ply.
>(Correct me if i am wrong.)
>
>Best Regards
>Oliver Roese

• Re: How much advantage give hash table? leonid 03:43:49 09/12/99
  • Re: How much advantage give hash table? Bert van den Akker 11:58:48 09/12/99
    • Re: How much advantage give hash table? leonid 16:06:29 09/12/99
    • Re: How much advantage give hash table? leonid 16:06:25 09/12/99
      • Re: How much advantage give hash table? Bert van den Akker 14:46:37 09/13/99

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.