Author: Dan Andersson
Date: 02:03:37 04/22/01
Go up one level in this thread
One could get a rough idea of the speedup if we think of the problem asymtotically. If we have a branching factor of ca 40 in chess, 40 processors would give about one ply more, 1600 processors two ply more. In a-b search without hashtable I would expect a speedup proportional to the square root of 40, and if the branching factor is lessened due to TT in a constant manner the formula for a-b with TT would be that constant per ply. The same might or might not be true for other search refinements. But we could get a guesstimate based on the effective branching factor for the search. Regards Dan Andersson
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.