Author: jonathan Baxter
Date: 17:24:15 06/28/98
Go up one level in this thread
On June 28, 1998 at 20:06:52, Vincent Diepeveen wrote: >So when i said: 18-20 ply is easy to do, then people laughed at me. > >Right now, diep gets after a day of search already 18-20. >It needs around 10k * 3600 * 24 = 840M nodes. > >That's with R=3 (for most programs R=2 and R=3 make no diff, but in >Diep it does), but nevertheless, this was considered *undoable* 2.5 years ago. > >Note that this is just with 60MB for hash, and at those slow levels >a doubling of hash give another ply because of the huge load factor. > >How opinions change. So 20+ ply for Diep is easily doable with 200M >nodes a second. In fact with say 1 gig for hashtables instead of the >60M i'm using now, i'll get 20 within few >seconds. Just to see how dumb this statement is: with enough forward pruning *any* program can search the full game tree and announce draw or win or whatever on the first move, for a stated "ply" of 200+. But unless it is always right, you can't claim it is searching to that depth. End of story. Jonathan Baxter.
This page took 0.01 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.