Author: Stuart Cracraft
Date: 14:04:14 09/19/04
In my search printout, for my per-iteration pv,
I print out the contents of pv[0][0] .. pv[0][pvlength[0]]
on the first line and then right under it I print out the
results of walking the hash table.
In most cases these agree. But fairly often, maybe one
iteration or two per search, the walk-the-hash-pv is
longer by a move or two than the triangular array pv.
So a few questions:
1) my code blocks the backing up of the triangular array
when the search has timed out. reasonable?
2) is the above normal that walking the hash gives sometimes
a longer pv?
3) I update my triangular array in the main search and the
quiescence search. reasonable?
4) Anything else you can think of.
Thanks,
Stuart
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.