Author: Robert Hyatt
Date: 15:48:25 12/05/05
Go up one level in this thread
On December 05, 2005 at 11:35:19, Joshua Lee wrote: >Hello, > >I had recently run a Nolot Position #5 using 2GB for Hash Tables Deep Shredder 9 >on a Single AMD Opteron 270 with 4GB of RAM. >The Solution was found after 24/60 ply and 5:14:36 17,374,579,000 nodes >well what i am confused about is how come it takes nearly an hour compared with >512MB for Hash Tables on a AMD 64 3200+ 2Ghz with 1GB RAM. >On the laptop the Solution was found in 4:28:24 and 22Ply. >Shouldn't it be the other way around? > >i will try with 512MB on the Dual core and see if that makes a difference. In general, bigger hash -> faster search results (shorter time to reach a specific depth.) But only "in general". Due to how hashing works, and the randomness it is based on (hash signature matching, random entry overwriting) changing anything to do with hashing can change the time in either direction for a given position. But in general, bigger is always better and this holds for the majority of positions.
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.