Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Redoing search, need help

Author: Will Singleton

Date: 14:44:02 11/05/98

Go up one level in this thread



On November 05, 1998 at 14:40:39, Dan Homan wrote:

>
>Hi Will,
>
>I think you function above is fine for all plies (even and odd), assuming
>that the score you return from eval() is really the score for the side
>that is on-move at depth = 0.  Naturally the score should be negated for
>the depth = 1, because the other side on move at depth = 1.


Don't quite follow you.  My eval returns a positive score if the player on move
from the start position has the advantage, regardless of the ply depth.  The
negation always occurs upon returning from the "value = -ab()" call.


>
>Now, for a one ply search, you are calling your function (with depth = 0)
>from some sort of driver... maybe like this -
>

Right, at the top level I have a call that starts the iterative deepening,
without negation.  But what do you mean by calling ab() with a depth of zero?
It will just return the eval for the starting position.  Do you mean a depth of
1?  Or do you mean that within your top-level call, you have already made the
ply 1 move?

Will



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.