Author: David Dory
Date: 04:11:20 04/07/03
Go up one level in this thread
On April 07, 2003 at 06:07:55, Steven Chu wrote: >I am in the process of looking at some search algorithms as part of a project at >the moment and the algorithms I have concentrated on are: >alpha beta pruning >minimax >minimax with alpha beta cutoffs >negamax >negamax with alpha beta cutoff >quiescence search >I would like to get code for these algorithms and test them out to see which one >performs the best and which one the worst out of them. If anyone knows of any >code out there or knows how I can go about doing this then please reply to me as >I would be very grateful for any help I get. > >Thanks for the time and help > >Steven Minimax of course, is the slowest, by far, since it exhaustively looks at every single node with no pruning. Alpha Beta, Alpha Beta pruning, and minimax with Alpha Beta cutoffs, are all terms used to describe the same thing. No difference. Since many nodes are not examined, it is much faster than minimax. Negamax and negamax with alpha beta cutoff are the same thing, also. Again, no difference. It may be just a tad faster than regular alpha beta - say 2% to 4%. You can read a lot more about quiescence search, and some of the others at: http://www.brucemo.com/compchess/programming/index.htm A search on Google, etc., for alpha beta will bring up several sites. Dave
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.