Author: Georg v. Zimmermann
Date: 03:37:35 04/07/03
Go up one level in this thread
Hello, I think it would be better for you to get definitions of what those algorithms do. Then you can find out which "performs best" without testing. The answer will be as simple as to this question: Who performs the best ? a bicycle >alpha beta pruning a man walking >minimax a man on a bycicle >minimax with alpha beta cutoffs a man walking wearing blue trousers >negamax a man wearing blue trousers on a bycicle >negamax with alpha beta cutoff the man's blue trousers >quiescence search Kind regards, Georg 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
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.