Author: leonid
Date: 16:48:06 02/17/00
Go up one level in this thread
On February 17, 2000 at 15:30:10, Jeff Anderson wrote: >Hi, right now I am trying to learn about the Alpha-Beta algorithm, I have a few >questions that maybe someone can help me with: > > >With sophisticated move ordering, like that found in Crafty, how much time is >saved (like in actual numbers or %'s) over having no alpha-beta alogirithm at >all? > >With random move ordering how much time is saved over having no alpha-beta >algorithm at all? > > >Are there any top programs which do not use the alpha-beta algorithm in their >search? > >If one has a program that creates a tree with no evaluations and no effort to >find the best move, simply creating a brute force tree, how much faster will >this be than when it creating a tree with evaluations attached (assume no >pruning or anything to the tree)? > > > >Thanks in advance, >Jeff Good questions! Will wait also for some interesting responses with you. About what I can see. If you will use only brute force search, difference will be, for the move that must be executed between 0.5 and 4 seconds on 400Mhz, in two plies. Without alpha-beta it will search 4 plies and with alpha-beta 6 plies. Without alpha-beta almost all the time you are forced to see as many moves (nodes) as you have in each ply. Exceptions are the ply that start with mate or draw. Alpha-beta will permit you to seach only 15% or 22% of your nodes in each ply and have complet response. Leonid.
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.