Author: Dann Corbit
Date: 14:50:58 06/11/99
Go up one level in this thread
On June 11, 1999 at 17:36:05, KarinsDad wrote:
[snip]
>A possibility to be sure. But, if there are a lot of these positions, I would
>not want my program to be searching a database instead of the current tree.
>Sounds time consuming (of course, we will not know unless we try).
I would guess less than one microsecond on any modern machine. Definitely well
under one hundredth of a second. And it will be a big win if you find one.
Besides which, you will do the inquiry anyway {the data already contains the
computer suggested move, the human suggested best move (if any), the ce, the
depth in plies, and so forth}, so the human tag (if it were to be calculated)
comes for free. With my current database of 1/2 million positions, that would
be log2(525804) = 19 in memory comparisons to collect a position from the
database. So (for instance) to collect a vector of 100 positions of interest
will take 1900 memory compares total.
There are tens of millions of computed points to examine (which will entail
time-consuming calculations before the external database is written), but the
external database is not nearly so large.
[snip]
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.