Author: Sune Fischer
Date: 06:01:43 04/06/03
Go up one level in this thread
On April 06, 2003 at 08:45:30, Dan Andersson wrote: > A precise formula? Not practical AFAIK with regards to transpositions and the >possibility of choice of lower branching, higher transpositional subtrees. > >MvH Dan Andersson It might be possible, in the same way it is possible to use a hash for counting perft. You have to add a few counters to your hash entry, each entry must know the average depth to which it searched. I suppose you might even need an array (like int [maxsearchdepth]), so when hitting this entry you add all the counters here to the current branch. You need of course some kind of triangle array for counters, just like when you assemble the PV. It's bound to be a mess, but probably doable :) -S.
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.