Computer Chess Club Archives




Subject: Re: PVS and MTD(f) branching factor

Author: Dann Corbit

Date: 16:57:19 06/17/03

Go up one level in this thread

On June 17, 2003 at 19:14:45, Uri Blass wrote:

>On June 17, 2003 at 19:00:23, Russell Reagan wrote:
>>With perfect move ordering, alpha-beta has a branching factor of the square root
>>of the min-max branching factor.
>It is wrong.
>I think that you forgot a lot of pruning and null move pruning together with
>other ideas reduce the branching factor.

Compared with pure minimax search, if your move ordering is perfect, you get the
same solution in about SQRT(D) nodes.

Other things will also reduce branching factor.

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.