Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Data structures question for hash tables

Author: KarinsDad

Date: 23:51:21 01/22/99

Go up one level in this thread


I realized after I sent the previous message that the average of 7 probes would
be to search and see if a transpostion is in the table (or to delete a node)
once you've gone through the entire 10 minutes (assuming that the table was
empty in the first place). This average would be there most of the time since
the table would not be cleared out between moves (except to prune out paths that
not the move made).

The average number of probes to add a node would be 11 at the end of the 10
minutes (and since the table is often somewhat full from previous searches, it
would be 11 a good majority of the time).

KarinsDad



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.