Author: Robert Hyatt
Date: 10:11:55 02/06/02
Go up one level in this thread
On February 06, 2002 at 11:43:58, David Hanley wrote: >Hm. I ran a 6-ply test from a "normal looking" middlegame position, and the >pawn hash acquired ~3300 entries. > >That seems to indicate to me that a 10 ply search could produce up to 1,000,000 >entries in a complex position. So if i stored 60 bytes per position, it'd need >like 60 megabytes. > >Seems like a lot. :( > >dave Nothing says the number of new positions grows linearly with time. It is almost certainly a log-type growth due to more transpositions as the search goes deeper... How did you conclude 1M positions? ten plies ought to be a tree 256 times larger so are you assuming that all those new positions are unique pawn 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.