Winboard Forum

Hi all

Recently I have read about APHID algorithm idea, and thing to myself to implement it for my chess engine. I'm intrested in is there anyone here who tried any kind of asynchronous parallelism of chess tree ? And what you thing about this at all ?

selectany wrote:Hi all

Recently I have read about APHID algorithm idea, and thing to myself to implement it for my chess engine. I'm intrested in is there anyone here who tried any kind of asynchronous parallelism of chess tree ? And what you thing about this at all ?

Here is the Aphid engine:
http://games.cs.ualberta.ca/aphid/index.html

Here are some things that use it:
http://www.frayn.net/beowulf/
http://larshj.dk/morphy/

It won't be nearly as efficient as a SMP approach. The APHID approach is good for some sort of project where you will have thousands of internet computers participating in the computation.
If you just want to write a fast, parallel chess engine, don't use APHID.