Computer Chess Club Archives

Search

Messages

Subject: Branching factor

Author: Sven Reichard

Date: 06:31:33 11/21/00

Go up one level in this thread

On November 20, 2000 at 23:24:49, Daniel Kang wrote:

>Also, alpha-beta pruning allows one to arrive at a correct minimax solution
>without having to search the entire tree, so your math is a bit off there as
>well.
>
>Dan.

It still needs to search (b/2)^n nodes, if b is the branching factor, and n is
the depth in plies, *even assuming* optimal move ordering. So the math wasn't
that much off after all.
Sven.

• Re: Branching factor Daniel Kang 11:37:45 11/21/00
• Re: Branching factor J. Wesley Cleveland 10:04:08 11/21/00
  • Re: Branching factor Robert Hyatt 12:02:45 11/21/00
  • b^(n/2) is right (NT) Sven Reichard 11:13:37 11/21/00

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.