Computer Chess Club Archives




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

Author: Dieter Buerssner

Date: 14:46:50 06/19/03

Go up one level in this thread

Thanks Dan. I think, we misunderstood each other slightly. You were focussing on
a mathematical relation between "move ordering quality" (as a value) and number
of nodes needed. My main variable was depth (vs. nodes). And of course
implicetly, that that the move ordering would change it (but I did not see the
move ordering quantitatively). I will think more about it, but at first thought,
I think we both are right. My argument was a bit more trival (which I don't
think means worse - I don't think it yet ... perhaps it will change after more
rethinking). I see, that better move ordering seems to give a better branching
factor. The speedup (with this view) is exponential then - or what would you a^d
vs. b^d with a < b?


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.