Author: Peter Fendrich
Date: 01:57:03 01/18/00
Go up one level in this thread
On January 17, 2000 at 17:04:05, José Carlos wrote: - snip - >>>suppose your bound from hashtable is n ply search based. Now you >>>search at ply = n-i ply where i > 0. >> >>I don't follow you here, what's i? depth? > > What he means is that the value from hash table comes from a deeper search (i >is the difference, so i>0), so the current search is unable to find something >that is "hidden" in the hash table value. > > José C. Ooops, I read ply=n-l where i > 0 Can't blame my font either... Thanks! //Peter
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.