Author: Dann Corbit
Date: 12:40:49 09/16/02
Go up one level in this thread
On September 14, 2002 at 04:52:14, Georg v. Zimmermann wrote: >>Chrilly Doninger's original source is available somewhere. I repeat: You DON'T >>want to use minimax. >> > >There is no harm in him first implementing a nega/minimax search, and later >adding alpha-beta, is there ? >He doesnt sound very certain about what the search does in a chess program (I >wished I have had an internet connection when I first tried) and in that case I >think its good to start from the very bottom. Alpha-Beta is not difficult conceptually or code-wise. Sort of like coding bubble sort, then moving to a better algorithm -- why bother with something known to be bad? The results are sure to be dissapointing. On the other hand, many programs I have seen have generic hooks into the search routine and try many different algorithms. This type of framework is a good idea for experimentation.
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.