Author: Odd Gunnar Malin
Date: 03:00:29 04/26/02
Go up one level in this thread
On April 26, 2002 at 05:21:23, Sune Fischer wrote: >On April 26, 2002 at 03:01:01, Odd Gunnar Malin wrote: >>You are probably right. Dennis M. Breuker did a test with several different >>replacement scheme in his 'Ph.D. thesis: Memory versus Search in Games' and >>found out that the gain start with much gain but begin to level out around 512K >>entries (If 1 entry=16byte, 16*512K=8M) and at 1024K or before the gain is only >>3% for each doubling. >>Ref: http://www.breuker.demon.nl/thesis/index.html , Chapter 2, page 35. >>This is for midlegame positions. >> >>Most gain from transposition tables is in the endgame, but here just a little >>table would gain many plies, so that the curve is maybe even more precipitous >>for endgames. >> > >It would interesting to see, if these numbers stay the same when the hash is not >reset before every search. >I do not reset the hash and can therefore use information found in previous >searches, I think the information found 3-4 moves ago can still be used if the >hash is big enough. I don't know if this is a big factor. > >-S. There is another question too. Engines+machines search a lot more nodes now than in 1998 so the 512K - 1024K levels should probably be a bit higher. Breuker's test was only to ply 7 and the main test was too see differences between various transposition table types and replacement scheme. Odd Gunnar Odd Gunnar
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.