Author: Robert Hyatt
Date: 19:42:07 02/06/02
Go up one level in this thread
On February 06, 2002 at 20:30:11, walter irvin wrote: >i was thinking of the best way to use 8 cpu's > >move >1 cpu #1 >2 >3 cpu #2 >4 >5 cpu #3 >6 >7 cpu #4 >8 >9 cpu #5 >10 >11 cpu #6 >12 >13 cpu #7 >14 >15 cpu #8 >16 >ect >ect > >with cpu #2 cutting off cpu #1 pv if bad , cpu #3 cutting off cpu #2 pv if bad >ect ect > >because i dont believe that an 8 cpu pc would see 8 ply deeper , this way i >believe it would ,to me this is better than splitting the problem at the root . First, that "cutting off" is the problem... you have cpus searching stuff that a one-cpu program would not search. Second, I think I have the only program capable of splitting the tree at the root, although I don't do it most of the time (most of the splits are deep in the tree at positions where everything needs to be searched most likely).
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.