Author: Robert Hyatt
Date: 06:42:42 09/08/01
Go up one level in this thread
On September 08, 2001 at 06:40:41, Gian-Carlo Pascutto wrote: >On September 08, 2001 at 06:35:24, Dann Corbit wrote: > > >>The ones with BM in the name are modelled after Bruce Moreland ideas. From my >>testing, these versions do better than any of the others (including crafty >>without extensions). > >What tests did you run? > >What did you change? > >How did you get SMP to work? > >-- >GCP He might not have noticed that "searchmp" has to be modified to make this work reliably. The last time I fiddled with this stuff, all the changes were in search.c... this means that if the program splits the tree into parallel pieces at a ply that should be "singular" then it will behave differently than it should... Dann: If you are convinced that this is really working reasonably on a single-cpu machine, let me know and let me know where the source is located. I will see if I can fix it up so that it will work correctly in a parallel machine as well...
This page took 0.01 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.