Author: Russell Reagan
Date: 14:31:59 12/17/03
Go up one level in this thread
On December 17, 2003 at 16:27:41, Slater Wold wrote: >Message passing computing is ugly... Of course, it would be a breeze if the efficiency of the search wasn't dependent upon the order in which the moves were searched. I guess that's another way to approach the problem. Rather than trying to figure out a way to make an efficient serial algorithm run efficiently in parallel, you could create some algorithm that would run efficiently in parallel from the get go. I guess it's debatable which is uglier :)
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.