Author: Gian-Carlo Pascutto
Date: 16:18:18 09/26/01
Go up one level in this thread
On September 26, 2001 at 19:03:12, Miguel A. Ballicora wrote: >One of the big problems of alpha-beta is that the machine is quite >stupid to determine how to traverse the tree and how to prune (pruning is not >part of the pure alpha-beta actually). Hmm? I'd say beta cutoffs are a perfect example of pruning. Not sure what you mean by 'pure alpha-beta' though Making something faster (in terms of nodes) than alpha-beta with perfect move ordering is simply impossible unless you start doing tricks with the hashtable (and try to reach the real minimal graph instead of the minimal tree). If alphabeta is the wrong answer, you were asking the wrong question. -- GCP
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.