Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: diminishing returns w/ increased search depth?

Author: Vincent Diepeveen

Date: 08:25:38 01/29/00

Go up one level in this thread


On January 29, 2000 at 02:00:09, Dann Corbit wrote:

>On January 29, 2000 at 01:25:51, Vincent Diepeveen wrote:
>
>>in all those cool graphs dudes take not take into account a couple of
>>things.
>>
>>First of all we had hashtables, then nullmove then now EGTB,
>>way better books recently, some work done at eval everywhere.
>>Some like me are even busy making a huge eval.
>>
>>Much of the 'lineair curve' so far that some want to show as evidence is
>>for largest part because of quality advances in the software, *not* the
>>hardware.
>>
>>If you put an old program at nowadays hardware, then those don't play
>>as well.
>>
>>I'm always surprised that such improvements in software get neglected
>>by graph makers.
>
>It's too abstract.  How do you put some cool new pruning algorithm into a pie
>chart?  If you can't draw it, it doesn't exist.
>;-)
>[snip]

By doing a few more experiments, instead of a single one.







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.