Author: Gian-Carlo Pascutto
Date: 08:19:25 01/30/02
Go up one level in this thread
On January 30, 2002 at 11:06:56, Vincent Diepeveen wrote: >>The branching factor is _directly_ related to the number >>of nodes needed to search to a certain depth. > >branching factor is the time needed to get to the next ply n+1, >this says nothing about the total number of nodes needed to >get to ply n. *Sigh* >Secondly there are 480 processors which all idle at the start, >and after playing a move it is a hell of a job to get them all >searching, and they had in the software part (first 5 plies) >already a lot of nonsense stored which helps relatively more >than it does for you and me, because we search more efficiently. I'm not aware of the exact details of their hardware and configuration. And neither are you as far as I know. What I do know is that the massively parallel machines I have seen had no big problems in utilizing all CPU's in a standard time control match. -- GCP
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.