Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: New SSDF-list

Author: Robert Hyatt

Date: 15:43:57 02/24/98

Go up one level in this thread


On February 24, 1998 at 16:56:03, Thorsten Czub wrote:

>>This
>>would be *very* ugly, but it is possible...
>
>I think the explanation comes very near to the truth.
>A few months I have heard the same from somebody out of the chessBase
>team. Or was it 1/2 a year, whenever, it was long ago and the it was the
>same explanation...
>Fritz needs hash-tables. With filled hash-tables the whole search is not
>coming any deeper and it cannot find a stronger line. If the hash-tables
>are filled you could stop the computation because it will not find much
>better stuff anyway.

I might try this sometime to see if it produces behavior similar to what
fritz produces.  But it would explain much, and if this is how he does
move ordering, too bad if the search is bigger than the trans/ref
table...



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.