Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Tuple-based processing

Author: E. Nielsen

Date: 04:12:52 11/11/04

Go up one level in this thread


On November 11, 2004 at 01:37:44, Robert Hyatt wrote:

>I've used C-linda here quite
>a bit, and we have our own implementation of a tuple-space system that we also
>use on our clusters...

Hi

May I ask if you have used c-linda in connection with a chessprogram?

We are currently developing a a chessprogram in java in connection with our
thesis. One of our goals is that the core-engine can use different strategies
for search and evaluation, so that in this way, if we want to use a parallel
search it will be encapsulated in the strategy. We want to use this for testing
the performance of the same evaluation and search-algorithms used as they are
compared to when used together with JavaSpaces. That is, the strategy becomes
the master and we have general workers started around on our LAN, which take
tasks from the space.

We are therefore interested in if there are others who have been doing something
similar. We have found one paper by Ciancarini in 1994 which is dealing with
parallel search algorithms based on Tree Splitting using GNUChess and Linda.

Regards
Eyưun Nielsen



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.