Author: Dave Gomboc
Date: 13:14:33 05/14/99
Go up one level in this thread
On May 14, 1999 at 15:32:54, Eugene Nalimov wrote: >On May 14, 1999 at 15:11:07, Dave Gomboc wrote: > >> >>I asked him, he says no, that isn't the case. Apparently Hsu gets better >>parallel speedup by using only one bound, even though his search tree is larger >>than it would be if he used two bounds. >> >>Dave > >I beleive the problem is not better speedup, but amount of silicon necessary for >keeping both bounds. And in a majority of cases (after we have the PV) the >second bound is unnecessary anyway. > >Eugene Your comment re: silicon may well be right, but apparently Hsu argued in his thesis that he achieved better parallel speedup using only one bound, so I think this must have been a factor in the decision. Dave
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.