Computer Chess Club Archives


Search

Terms

Messages

Subject: PV length ???

Author: Nagendra Singh Tomar

Date: 17:10:17 10/25/02


Hello all,

If we are using PVS search and assume that at the root, the 2nd move (searched
with a zero window) turns out to be the best move. Since we are passing a zero
window down to that subtree, at all the plys below, it will either fail-low or
fail-high, so none of the plies will update the PV. In this case we will get a
pv length of 1 (with only the root move in the PV).
Is this true whenever any move other than the first move tried at the root lies
on the PV.
How do we fill the PV in such cases ? using trans table ?

regds
tomar



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.