Author: Jan Pernicka
Date: 05:05:13 03/22/00
Go up one level in this thread
On March 22, 2000 at 07:12:59, Inmann Werner wrote:
>On March 22, 2000 at 06:30:58, Jan Pernicka wrote:
>
>
>I use up to 9 ext in one branch. If you have deep mate threats with much check,
>it is helpful.
>
OK - but I think it slows speed (i.e: completing searching) too much...
- Do you distinct "good" and "bad" checks ?!
That number - 9 extens. - do you use it for all (which?) types of extensions?
this questions(better say-answers) are crucial in making "good" program.
Also interesting is (in average) ratio: r = a/b , where:
b - #nodes visited when no extension is used
a - #nodes visited (in the same position as in a) ) with extensions
Note: in this case I include quiescence search also into b because
I think (is it true?) that other extensions have nothing common with
quiescence search - i.e.:when reaching the horizon (depth==0), they
in case a) use the same quiescence search as in case b)... (?)
I suppose that ratio r is normally around 3 or 4 - is it true or not?
(But in your case it can sometimes be much, much more - seems...?!)
>
>Reasons of win:
>3)the engine makes a king side attack, not seeing anything tactically, but
>"liking" positionally the attack. It gives pressure until it sees something
>tactically.(this is tricky, cause often, if the attack fails, you are lost)
>(Comet? Hossa)
This seems to me not too safe...
>4)Both engines do not know really what they do, but at one time, one stands
>clearly better and wins. (Both engines give 0.00 or so and move around)
It would be interesting to know how ofter this (point 4) ) happens...
>
>This also is a ranking IMHO
Excuse me, what IMHO means ( i am not too strong in abbr. :) )
So - let's summarize the problem:
how to make extension "good-and-safe-working"?
(i.e: better than exhaustive searching with relatively low time costs)
Thank you for useful information.
Jan
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.