Author: Bruce Moreland
Date: 12:59:55 11/14/99
Go up one level in this thread
On November 14, 1999 at 14:36:55, Bella Freud wrote: >As a minimum parallelisation, which is his main claim to fame as a unique >contribution. I don't think Bob invented parallel search. He has a working example out there that people can look at, and he's written a very good paper or two. He's not written the only paper on the subject, certainly. Bob had early access to good hardware, so he was a pioneer in that regard. I wrote and debugged my parallel search in a few weeks without more than glancing at the Crafty source, although I did talk to Bob to ask him how he handled some cases, and to discuss the problem in general, and I read his paper and every other paper that's been published in the ICCAJ in the past fifteen years. It is a very hard problem, and it's possible to have terrible bugs, but it is not an earth-shakingly hard problem. bruce
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.