Author: Robert Hyatt
Date: 13:31:29 09/27/01
Go up one level in this thread
On September 26, 2001 at 13:02:12, Robert Hyatt wrote: >On September 26, 2001 at 11:41:03, Vincent Diepeveen wrote: > >>On September 26, 2001 at 11:39:05, Vincent Diepeveen wrote: >> >>please also print for each depth the number of nodes you need! >> >>depths 12/13 with R=2 or R=3 you get within a few seconds or so.\ > >I don't get depth 12/13 in a few seconds. It is more like a few minutes. >What use is the node count? In chess you don't get to search until you >have searched X nodes. You get to search until you have used Y seconds... > > > >> >>All the 2.0 speedups i get here i never get within a few seconds. >>it's always levels which i can't realize in tournaments. > >I don't have that problem. I can get 1.9 in a few seconds or a few minutes >or a few hours. I assume this topic is "closed"? No more comments since I posted some real data to show that null-move has nothing to do with parallel search efficiency...
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.