Author: leonid
Date: 04:34:08 08/04/00
Go up one level in this thread
On August 04, 2000 at 00:46:19, Tom Kerrigan wrote: >On August 03, 2000 at 23:12:12, leonid wrote: > >>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. > >I clearly explained where the root of the tree is. It's the first node that you >search. >-Tom Then really you have 100% identical ply search. Completely different from mine. Now I am even not sure if Bob H. do it differently. Maybe I was lost in terminology. Two plys from which search start done differently in my program but this difference is not crucial for the speed. Two plys from the start are different because in first of them you are forced to see all moves (I neglect here few exceptions). Zero ply and one below mainly because of tactics, even if the part was hardly even started. If only your way of writing is one that is very commune it could be the reason why in Fritz I see so high NPS numbers. Sometime they are just to high to even approch them and still my tactics is in embrion stage. Tactics still must lower my NPS in unknow proportion. Tom, what will be your estimation for the lost in time or NPS for the program that have its tactics compeltely written and the same that don't have them? 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.