Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Precision about NegaMax (on B. Moreland's site)

Author: Mathieu Pagé

Date: 07:13:00 04/08/04

Go up one level in this thread


On April 08, 2004 at 09:01:14, Andrew Wagner wrote:

>[snip]
>>
>>Hi,
>>
>>What I was asking is: «Is this an NegaMax variation of AlphaBeta ?»
>>
>>sorry, i realize I was not really clear.
>>
>>Mathieu P.
>
>
>Here's the way I understand it, based on Bruce's site. The min-max method was
>developed first, and essentially had one function which minimized the score, and
>another function that maximized the score. Negamax did essentially the same
>thing, but a lot more efficiently.
>
>Then Alphabeta came along, and modified the Negamax function. It does more or
>less the same thing, but a LOT more efficiently, by passing bounds around. I
>guess you could call it a variation of Negamax....in the same way you would call
>Kasparov just another chess player.
>
>I suggest you have a read through Bruce's site...his explanations are
>entertaining and very clear. I learned a ton from them. Hope that helps!
>
>Andrew

Hi Andrew,

Thanks for your reply.

You just confirm what I tought. I have already red the Bruce's site, but until
english is not my native language I sometime need a confirmation of what I red.

again, thank you.

Mathieu P.



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.