Author: Antonio Dieguez
Date: 10:31:24 10/26/02
Go up one level in this thread
> In my example in the other post I used alpha and beta as the bounds we use for >the pv search (I'm assuming an aspiration window). > After the pv is searched, we go into null window searches (PVS), so beta is >not used anymore (we search alpha,alpha+1). Still, if we have a variable called >beta, it will hold the value previously assigned. > After the null window search, get get a score, which is not alpha nor beta, >but just 'score' (I think you called it aux). > What you're interested in about this aux is "is it bigger than alpha?" because >you searched alpha,alpha+1. > If instead you did: > beta=alpha+1; > aux=-search(-beta,-alpha); > Then you'll _never_ get a score between alpha, and beta, obviously. > So the following test if (aux > alpha && aux < beta) will be always false. > After you get your aux from the search, if it's bigger than alpha, you want to >research [aux,aux+n] where n is positive, or simply [aux,+INFINITY]. > As you see, the previous beta doesn't have anything to do with this process. of corse, now i see what you meant in the other post too. You know, when these things happen I feel motivated to see only anime music videos and forget about computer chess the rest of the day. (Yes, I can be in front of the computer several hours.) see you.
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.