Author: William H Rogers
Date: 08:01:34 03/13/03
Go up one level in this thread
On March 13, 2003 at 03:59:13, Steven Chu wrote: >I am doing some research on different search algorithms, in particular: >alpha beta pruning >minimax >minimax with alpha beta cutoff >negamax >negamax with alpha beta cutoff >quiescence search > >I just wanted to know if anyone has any ideas on the comparisons and contrasts >of each of these different algorithmic processes compared with eachother and >humans. Also if anyone knows anywhere where i can obtain such information i >would be most grateful. > >Thank you > >Steven Chu First of all negamax is the same as minimax it just uses fewer lines of coding. Negamax with alpha beta cutoff is just alpha beta and alpha beta pruning is what alpha beta does by itself. Quiescence comes into play once you have reached the end of your search depth, for example: Say you only searc to a depth of 8 plys, then you program is blind beyond that point. Quiescence then checks to see if the last move made can be recaptured by the other side or puts a king in check, if so then it goes to the next ply and checks everything once again. In most cases it only checks on the square that the last move was made to and does not do a complete search of all moves. I hope that I put this in a clear enough manner to understand. Bill
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.