Author: leonid
Date: 20:12:12 08/03/00
Go up one level in this thread
On August 03, 2000 at 17:59:47, Tom Kerrigan wrote: >On August 03, 2000 at 17:31:04, leonid wrote: > >>On August 03, 2000 at 14:14:38, Tom Kerrigan wrote: >> >>>I have 3 search functions: >>> >>>root_search() >>>search() >>>quiesce() >>> >>>The first two are almost identical, except root_search has some extra stuff for >>>the root of the search tree. Tom, I sent my response but came here once again to be sure in the most important question. You have "some extra stuff for the root of the search tree". What is for you "root"? Ply zero, or ply that will be reached when X numbers of plys will be searched? For me, after your terminology, ply numbers (x-1) and (x) are very distinct from all others. Leonid.
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.