Author: Dennis Breuker
Date: 13:09:25 12/02/02
Go up one level in this thread
On December 01, 2002 at 16:08:53, Andreas Guettinger wrote: >Can anybody explain me the difference between BIG1 and BIGALL? > >from the article >"Replacement Schemes for Transposition Tables", D.M. Breuker From page 32 of my thesis (http://www.breuker.demon.nl/thesis/): <begin quote> Big1 counts a table position in a transposition table as a single node, BigAll as N nodes, where N is the number of positions searched in order to obtain the information of the table postition stored. <end quote> What I mean here is that with Big1 I count a TT hit as 1 node, whereas in BigAll I count a TT hit as N nodes, where N is the size of the subtree under the TT hit. This is all pure academic, since the size of the subtree (Deep, TwoDeep) is just as good and easier to maintain. Cheers, Dennis Breuker
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.