Computer Chess Club Archives




Subject: Re: Parallel algorithms in chess programming

Author: Tony Werten

Date: 00:08:42 04/17/01

Go up one level in this thread

On April 16, 2001 at 18:15:52, Dieter Buerssner wrote:

>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.

I haven't tried parallelism yet, but my (very) simple approach would be:

Since my program spends most of its time in eval(), split it in evalblack() and
evalwhite(). No need for many changes. Haven't got a clue what the speedup would
be, but it's easy to try.



This page took 0.03 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.