Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Algorithm for multi processors

Author: Dan Andersson

Date: 14:28:54 11/09/04

Go up one level in this thread


On November 09, 2004 at 16:21:56, Christophe Drieu wrote:

>Hi, what is the basic idea to play chess on bi-processors ? Is it something

 The basic idea is to split work. But as far up in the tree as possible.

>like:
>
>nb_moves=generate_all_moves();
>
>Create 2 threads
>   The first one analyse the nb_moves/2 first moves
>   The second analyse the nb_moves/2 next moves
>
>Take the best move from the two analysis.

 If you look at this you will see that you will have two search trees that are
roughly half the size of the original one. And given the nature of alpha beta
search you will have a speedup proportional to sqrt(2) for two processors.

MvH Dan Andersson

>
>Regards



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.