Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: NPS, EBF, Knowledge and Elo

Author: Sune Fischer

Date: 11:44:18 08/15/03

Go up one level in this thread


On August 15, 2003 at 14:03:12, Ricardo Gibert wrote:

>
>So if hypothetically we were to actually have 32-man EGTBs, you would expect the
>program using them to play equally strong to a program not using any EGTBs?
>
>It helps to know the reasons why EGTBs do not significantly add strength to
>programs. Applying empirical results without understanding the reason for the
>result will inevitably lead you astray.

Because 99 times out of 100 the game has already been decided when they reach
the EGTBs. And the tables are too slow to be used at the leafs from great
distances.


>>Yet another type of knowledge is search depth.  So I don't think it is possible
>>to separate the two cleanly.
>
>
>I'm actually very interested in not separating them cleanly. I'd like to know
>the relationship between search depth knowledge and eval knowledge. It is useful
>to know which one to try to emphasize.

They go together like yin yang.

What is too expensive to search you evaluate, and what is too complex to
evaluate you search.

-S.



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.