Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Data structures question for hash tables

Author: Robert Hyatt

Date: 19:26:13 01/22/99

Go up one level in this thread


On January 22, 1999 at 18:49:54, KarinsDad wrote:

>On January 22, 1999 at 17:33:54, Robert Hyatt wrote:
>
>[snip]
>>
>>minor 'nit'...  hash entry = 16 bytes... so that is 80mb.  But in a game
>>of 40/2, where I search (counting pondering) for 6-10 minutes, that turns
>>into 10*60*500000*16 = 5 gigabytes if I counted right.
>>
>
>minor 'nit'... 5*60*500000*16 = 2.5 gigabytes for pondering of 5 minutes plus
>< 2.5 gigabytes for pruned hash of all paths that were not the pv (i.e. the move
>made), otherwise, if you didn't prune, then you would have to save all of the
>positions for the entire game and that number gets way too large (and of course
>you were not even counting transpositions and leftovers in the pv from earlier
>moves).
>
>Just having fun with you Robert :)
>
>KarinsDad


:)



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.