Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: DB will never play with REBEL, they simple are afraid no to do well

Author: Ratko V Tomic

Date: 12:36:06 10/16/99

Go up one level in this thread


> I thought that might be the case after I did this calculation on my own
> program's results and got 5.1--I thought I'd introduced a bug or something
> at first.  Then I decided it was blowing up due to excessive extensions.
> Anyway, that calculation was on a tactical possition which (elsewhere in
> this thread) Bob says will give larger nunbers.

I guess it depends what kind of tactical position. Something that unfolds at the
knife's edges, as it were, with only one, at most two, decisevely winning and
the rest decisevely losing moves, would have very efficient cutoffs and the
clear cut best move (or couple) from itereation to iteration. Position with lots
of pieces but without any urgent threats and not cluttered or blocked, positions
where many viable long term manouvers exist, would be the most expensive since
several good alternatives differ a little and for fragile reasons which will
vary from iteration to iteration. So the sorting will fluctuate for random
reasons and cutoffs will be less efficient.

> I know I've measured my program doing BF's of 3 or so, but on most of
> the test positions I've just tried I get about 4.6...

That's exactly the middle of the interval 4.5-4.7 I measured on Crafty 16.6
engine (with root width 38).



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.