Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash table usefulness

Author: Dan Andersson

Date: 16:38:54 11/24/01

Go up one level in this thread


There are several non obvious transposition table issues in many games. I will
mention a few:
 Most transpositions occur at the same depth of the tree.
 Most interior nodes will be located close to the leaf node due to the
geometrical growth of nodes.

 These two make it clear that it is more beneficial to probe for transpositions
deeper down in the tree. Because most of the time in search will be spent close
to the leaf nodes. And why always replace works OK for transposition tables. A
TT lookup is beneficial because it not only replaces search but also gives move
ordering information that also helps to reduce the search tree. That is the main
gain when using transposition tables in Othello.

Just a few reasons.

MvH Dan Andersson



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.