Computer Chess Club Archives

Search

Messages

Subject: Questions on the Alpha-Beta algorithm and other things.

Author: Jeff Anderson

Date: 12:30:10 02/17/00

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

• Re: Questions on the Alpha-Beta algorithm and other things. Dan Newman 00:13:19 02/18/00
  • Re: Questions on the Alpha-Beta algorithm and other things. Sanjiv Karnataki 08:37:34 02/18/00
    • Re: Questions on the Alpha-Beta algorithm and other things. José Carlos 09:02:59 02/18/00
      • Re: Questions on the Alpha-Beta algorithm and other things. J. Wesley Cleveland 15:10:18 02/19/00
• Re: Questions on the Alpha-Beta algorithm and other things. leonid 16:48:06 02/17/00
• Re: Questions on the Alpha-Beta algorithm and other things. Sean Empey 13:23:35 02/17/00
  • Re: Questions on the Alpha-Beta algorithm and other things. Olaf Jenkner 16:18:48 02/17/00
    • Re: Questions on the Alpha-Beta algorithm and other things. Tom Kerrigan 18:52:26 02/17/00

This page took 0.01 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.