Computer Chess Club Archives




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

Author: Dieter Buerssner

Date: 12:06:39 06/18/03

Go up one level in this thread

On June 18, 2003 at 12:56:36, Russell Reagan wrote:

>I was wondering if pvs/mtd(f) with perfect move ordering led to a decrease in
>the branching factor over alpha-beta with perfect move ordering, or only a
>constant speedup.

Robert already answered this. It will have the same branching factor, and will
visit the same number of nodes. In the case of PVS, it is really easy to see.
With perfect move ordering, you will search exactly the same tree, as with
normal alphap beta (not a single research because of a fail high in the zero
window search). Neither would be negascout different in this regard. Negascout
will (compared to PVS) not need some researches, when close to the leafs (and
will not work with quiescence search or extensions). But with perfect
moveordering, this saving will never be needed.


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.