Author: Dann Corbit
Date: 11:10:25 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. Every one of these techniques is O(exp(n)), where n is depth in plies. They just have smaller constant multipliers. Alpha-beta reduces the effort to sqrt(nodes) which is O(exp(n/2)) but that is [of course] still O(exp(n)). Better than negamax is negascout. Do a web search for it. Basically, you search the heck out of the pv moves and a narrow search on any others. As long as your move ordering is good, you get a big savings.
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.