Author: Will Singleton
Date: 23:01:39 07/14/99
Go up one level in this thread
On July 15, 1999 at 00:33:00, Scott Gasch wrote: >Hi there, > >My question is this: how much time is lost maintaining some sort of data >structure to record the PV as you search? Wouldn't it be better just not to >worry about the thought process but rather just get the one move that the top >level search routine returns and make it? > >Along the same lines, what is the best data structure to store the PV as you >search? I am thinking of an array of stacks... but the algorithm seems like too >much overhead. Is there a better (i.e. simpler or faster) way to maintain the >PV as you recursively alpha-beta search? > >Thanks, >Scott It's not an easy subject! But it turns out that there's very little overhead to storing the pv, since it changes infrequently. As far as the way to do it, have a look at TSCP. I think you can get it via the links section here, in programs. Will
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.