Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Interesting numbers about hashing - 32 bits are clearly not enough

Author: Robert Hyatt

Date: 21:09:35 12/07/01

Go up one level in this thread


On December 07, 2001 at 23:49:14, James T. Walker wrote:

>Hello Bob,
>
>I quote from above:
>"Good hardware today can easily go 3-4M nodes per second.  Say 4 to make it
>round.  that means 1M seconds or 2 years.  Safe for today probably.  But
>the problem returns in a few years."
>
>1 million seconds is about 11.57 days not 2 years.  ( 1 day = 86400 seconds)
>Jim

OK..  the suggestion was dividing nodes by 1K to produce Knodes, which would
be stores in an unsigned int.

That gives 4,000,000,000 Knodes, or 4,000,000,000,000 nodes total.  at 1M
nodes per second, that comes to 4,000,000 seconds.  I get 46 days to search
that many nodes at 1M, 11 days to search it at 4M.  My 2 years was obviously
wrong.  I think I left out one divide by 60 in haste...




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.