Author: Gian-Carlo Pascutto
Date: 15:44:59 11/08/02
Go up one level in this thread
On November 08, 2002 at 17:05:51, Robert Hyatt wrote: >>That's a peanut time investment compared to a full SMP algorithm like >>Crafty, Sjeng, not to mention what DIEP uses. >> >>Crafty and DIEP needed years to bugfix, > >Don't know where you have been, but the parallel search in Crafty took two weeks >to write. It may well _still_ have a bug or two that I haven't seen show up, of >course. I'm tempted to say, the time to write it is irrelevant, it's the time to get it working well that matters. Debugging and testing a parallel search takes 'quite' a bit more time than writing one. In fact, the above is true for almost everything in programming. -- 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.