Author: Dieter Buerssner
Date: 15:15:52 04/16/01
In a different discussion, Vincent wrote the following: >It is not difficult to implement the form of parallellism as used by >Rudolf. Invented by a frenchman who couldn't spell a word english and >who wrote an impossible article for JICCA (did anyone proofread it at >the time as i'm pretty sure they didn't get his parallel idea?). > >At the time when i read the article i was pathetically laughing about it >actually as i also didn't get the idea of the frenchman. But it appears >everyone who can make a chessprogram work under win2000 can also get >within an afternoon his program parallel to work. Then some debugging >and a day later it works cool. I'd be very interested in this algorithm, that can be implemented at an afternoon :-) Could you point elaborate on this. BTW. In Paderborn, Roland Pfister also told me, that he knows this from Rudolf Huber, and he even started to explain it to me. Somhow, we (or me) got distracted, and I cannot remember the essential things. What I remember is, that the time consuming work, of making your search/evaluation routines free from all those global variables is not needed. Regards, Dieter
This page took 0.08 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.