Author: Dann Corbit
Date: 21:36:21 09/10/02
Go up one level in this thread
On September 11, 2002 at 00:24:57, scott farrell wrote: >interesting approach to large search tree and lots of CPUs, hand out the work >randomly. > >Sounds a little like MTD(f) - start off with a guess, if its a good guess you go >faster. > >I couldn't work out in the end if they were faster than the normal crafty or >not. The large table of speedups didnt really say how it was compared to >standard crafty, if it was at all. Since the speedup was almost linear, I would say it is better than any [other] known method.
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.