Computer Chess Club Archives




Subject: Re: Doesn't appear to work for me (full data)

Author: Uri Blass

Date: 01:52:21 11/21/02

Go up one level in this thread

On November 21, 2002 at 04:48:15, Uri Blass wrote:

>On November 20, 2002 at 19:02:49, Gian-Carlo Pascutto wrote:
>>On November 20, 2002 at 18:54:30, Omid David Tabibi wrote:
>>>>Could you please compare (Adptv + small quiesc) vs (Vrfd +small quiesc) ?
>>When I have more time.
>>If you want more data, I expect others will post results
>>from their programs as well. Maybe those are more encouraging...
>I will post after I implement the code.
>I have a problem because I am not sure how to implement the code in movei:
>Movei does not use null move pruning when the remaining depth is 1.
>I have special pruning rules for that case
>The pseudo code of movei is:
>int alphabeta(int depth, int alpha, int beta)
>2.if (depth<=0) return quiescence()
>3.if pruning rules happen return beta(pruning rules happen mainly when depth=1)
>4.if repetition return 0
>5.if null move conditions(null move conditions include depth>=2)
>donull move;
>if (val>=beta)
>return val;
>...standard alphabeta
>When I try depth>=1 instead of depth>=2 I find that it probably does not help
>me(maybe because of my pruning that happen often when depth=1).

I did not do a full test suite but I found in few test positions that sometimes
I even get a bigger tree with depth>=1 and not with depth>=2 and that I also get
less nodes per second with depth>=1 so I decided not
to use it because taking more risks does not seem to be a good idea if I often
get a bigger tree and search slightly slower.


This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.