Author: Slater Wold
Date: 23:31:19 09/04/02
Go up one level in this thread
On September 05, 2002 at 00:47:17, martin fierz wrote: >thanks, this is really interesting. i never realized that SMP searches could be >so variable in some positions and very stable in others. >actually, vincent might like this, because it's >2 speedup :-) > >aloha > martin I have seen on my duals, more than once, an SMP program solve a problem in 3 minutes. Then 2 hours later I try the same position and it solves it in 5 minutes. SMP is *way* to random in its branching to be what normal people call "stable".
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.