Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Alpha-beta search?

Author: Daniel Clausen

Date: 15:19:18 10/22/03

Go up one level in this thread


On October 22, 2003 at 18:08:16, Gopi wrote:

>If suppose i do val=minmax(1) and i get val=90 and if i do
>val=alphabeta(1,-Infinity,Infinity)in the same position do i get val=-90 or same
>val=90?

MiniMax works with absolute scores (eval() returns an absolute score) and
typically two functions (min() and max()) which basically have the same logic
except that min() is minimizing and max() is maximizing)

NegaMax works with relative scores (eval() returns score from point of
side-to-move) nad has just one function which maximizes the relative scores.
Results coming from a subsequent call to NegaMax have to be negated of course.

MiniMax and NegaMax produce the exact score for a position and use the same
amount of nodes to calculate.


AlphaBeta is a clear search enhancement which also produces the exact score for
a position and typically uses much less nodes.


The site http://www.seanet.com/~brucemo/topics/topics.htm (and surely others)
discuss alpha-beta in depth. (among many other interesting search-related
things)

HTH

Sargon



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.