Computer Chess Club Archives




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

Author: Uri Blass

Date: 00:05:03 06/20/03

Go up one level in this thread

On June 19, 2003 at 20:21:26, Dann Corbit wrote:

>On June 18, 2003 at 14:07:15, Uri Blass wrote:
>>On June 18, 2003 at 14:00:19, Dann Corbit wrote:
>>>On June 18, 2003 at 08:45:52, Uri Blass wrote:
>>>>No It is not logical.
>>>>Better order of moves gives exponential speed up.
>>>A "mathematical exaggeration".
>>>Perfect move ordering will reduce the number from K nodes to approximately the
>>>square rook of K compared to random move ordering.
>>k^n to k^0.5n is an exponential improvemrent.
>>Even k^0.52n to k^0.51n is an exponential improvement.
>K^n = Tn
>K^(n/2) = K^n/K^2 == (1/K^2)Tn


K^(n/2)is not K^n/K^2
K^(n-2)= K^n/K^2


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.