Author: Andrew Dados
Date: 15:46:03 05/01/02
Go up one level in this thread
On May 01, 2002 at 18:28:58, David Hanley wrote: >On May 01, 2002 at 15:44:54, Andrew Dados wrote: > > >>well.. the only PV you ever get in entire tree is backed up to root anyway... >>unless your search is broken. :) > >If that were true, you would not need a triangualar array to store the PV? > >In some inner node of the tree, you may very well get a line that MAY be a new >PV. It's a good line from this position. But I suppose you are saying this >should not be called PV? In that case you are right, maybe inner PV(IPV) is >what i should say. > >The idea is just to store are good line from a position when possible, instead >of only a good move. Of course i emphasize "when possible" > >dave That's what hash table does anyway...
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.