Author: Dann Corbit
Date: 11:40:12 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. Negamax is really helpful just for notation. The difference between minimax and negamax is just that we reverse roles and return the negative of the search between turns. It makes it easier to understand and you don't need two different search functions. >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. It is negamax with early exit. If we found a bag of money and the next bag is full of razor blades, we just go on to the next bag. >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
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.