Author: Ulrich Tuerke
Date: 12:46:41 09/09/03
Go up one level in this thread
On September 09, 2003 at 15:36:54, Jose Santos wrote: >Hi, > >First of all, thanks for your post. > >>I don't think that this is weird behavior. The AB-search returns an exact >value for the best root move only; the scores for the remaining moves aren't >exact values but upper bounds. > >That's true but even without the Alpha Beta cuts the values returned are the >same I posted. I can't understand this. They should differ much more. (I think) >This way there are only 3 or 4 different scores and there are many moves with >highest score (and some are "bad"). So, are you saying that a pure minmax search delivers the same values ? How about the node counts in either case ? That's hard to believe for me. IMHO, grouping the scores like in your case above, looks to me very much like a consequence of alpha-beta. If in your case, alpha-beta and minmax-pure deliver the same set of scores on the root level, then something is definitely going wrong. Uli > >Regards, > > Jose Carlos
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.