Re: chess and grid computing
- From: Simon Krahnke <overlord@xxxxxx>
- Date: Mon, 12 Jan 2009 07:42:34 +0100
* lonewolf <jon.sero@xxxxxxxxx> (2009-01-10) schrieb:
I'm wondering if there has been any research or work done on the
problem of chess and grid computing. Specifically, it seems to me
that the "problem" of chess can be decomposed easily enough (by
sending nodes of the search tree to nodes of the network for
evaluation)
Evaluating a single position is far too easy to be done to be
distributed. Distribution adds too much overhead.
A grid is like a slowly communicating cluster. SMP systems a least have
shared memory, clusters only have there interconnects and grids got the
Internet.
So you distribution units that are calculated within seconds, which
quite large when a single node in the grid can be a powerful cluster.
and theoretically if its then possible to create a chess
playing network that could possibly be quite good (given enough
participants). Imagine a million PC's working together and playing
Hydra? I'd like to see that game.
Thoughts?
If it were that easy people wouldn't care to build Hydra.
mfg, simon .... l
.
- References:
- chess and grid computing
- From: lonewolf
- chess and grid computing
- Prev by Date: Re: chess and grid computing
- Next by Date: Re: chess and grid computing
- Previous by thread: Re: chess and grid computing
- Next by thread: Re: chess and grid computing
- Index(es):
Relevant Pages
|
