Author: Daniel Clausen
Date: 04:07:42 08/26/03
Go up one level in this thread
On August 26, 2003 at 06:00:51, Hans Bogaards wrote: [snip] >In my old program I first used a 2 dimensional array PV[MAXDEPTH][MAXDEPTH] and >stored the best move in PV[Depth][Depth] and copied the rest of the PV from >PV[Depth + ][Depth + X] to PV[Depth][Depth + 1]. This worked but was very slow. Did you measure it? I don't think it's very slow. The PV doesn't change _that_ often. (speed is the product of the time it takes to execute something once and the times it gets executed) Other people don't store it at all but retrieve the PV from the hashtable. I personally don't like this approach since it couples 'having a PV' with 'using a hashtable'. YMMV Sargon
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.