Reply
 
LinkBack Thread Tools Display Modes
  #1   Report Post  
Old January 10th 09, 10:28 PM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: Jan 2009
Posts: 1
Default chess and grid computing

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) 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?
  #2   Report Post  
Old January 11th 09, 09:54 PM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: May 2006
Posts: 179
Default chess and grid computing

On Sat, 10 Jan 2009 14:28:25 -0800 (PST), lonewolf
wrote:

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) 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?


Here's one fairly recent example:

http://www.grappa.univ-lille3.fr/icg...ram.php?id=520
  #3   Report Post  
Old January 12th 09, 06:42 AM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: Jul 2006
Posts: 625
Default chess and grid computing

* lonewolf (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
  #4   Report Post  
Old January 12th 09, 08:14 AM posted to rec.games.chess.computer
Banned
 
First recorded activity by ChessBanter: Dec 2008
Posts: 2,402
Default chess and grid computing

On Jan 11, 3:28*am, lonewolf wrote:
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) 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?


I do not understand what do you want to do with Grid Computing?

If you want to play Chess you can play at: http://www.GetClub.com/Chess.html

Todays computers are so fast that no task takes long time.

With Quad Core processors and Graphics cards you can speed up any
application by a factor of 10.

So speed is not a limit for todays computers.

What do you want to do? Do you have enough budget for Grid Computing?

Bye
Sanny

Play Chess at: http://www.GetClub.com/Chess.html

  #5   Report Post  
Old January 12th 09, 08:52 AM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: Jul 2006
Posts: 625
Default chess and grid computing

* Sanny (09:14) schrieb:

With Quad Core processors and Graphics cards you can speed up any
application by a factor of 10.


Oh, fantasy land again.

mfg, simon .... l


  #6   Report Post  
Old January 12th 09, 02:41 PM posted to rec.games.chess.computer
Banned
 
First recorded activity by ChessBanter: Dec 2008
Posts: 2,402
Default chess and grid computing

On Jan 12, 1:52*pm, Simon Krahnke wrote:
* Sanny (09:14) schrieb:

With Quad Core processors and Graphics cards you can speed *up any
application by a factor of 10.


Oh, fantasy land again.

mfg, * * * * * * * * * * *simon .... l


Nvidia claims its graphics card has 200-400 cores and can speedup
Applications by a factor of 10-50.

http://apcmag.com/nvidia_lands_cuda_100x_faster.htm

World is stranger than fiction.

Bye
Sanny

Play Chess at: http://www.GetClub.com/Chess.html


  #7   Report Post  
Old January 12th 09, 02:44 PM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: Apr 2005
Posts: 2,598
Default chess and grid computing

lonewolf wrote:
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) 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.


Things that distribute or parallelize well are things that can be cut
into small packages. Distribution is great for cracking codes because
you can have each machine try a bunch of different keys. It's great
for finding messages from the aliens because you can give a chunk of
data to each machine and ask if there's a message in there.

Chess doesn't distribute particularly well because of transpositions.
When a single processor machine considers 1.d4 d5 2.c4 it sees the
position it just saw after 1.c4 d5 2.d4 and doesn't need to do any
more work. In a distributed system, you have to do all that work
again because you don't have the database of positions that all the
other nodes have seen.

Even on a multiprocessor machine with shared memory (and, therefore, a
shared database of transpositions), things are difficult because you
have to be very careful about concurrent accesses to the table. This
co-ordination hits the efficiency of the system and it's even worse
in the distributed case. Multiprocessors and distributed systems can
search faster than a single processor but it's nothing like `ten
processors or ten machines is ten times faster than one processor.'


Dave.

--
David Richerby Happy Spoon (TM): it's like a piece
www.chiark.greenend.org.uk/~davidr/ of cutlery that makes your troubles
melt away!
  #8   Report Post  
Old January 12th 09, 03:52 PM posted to rec.games.chess.computer
external usenet poster
 
First recorded activity by ChessBanter: Apr 2005
Posts: 2,598
Default chess and grid computing

Sanny wrote:
Simon Krahnke wrote:
* Sanny (09:14) schrieb:
With Quad Core processors and Graphics cards you can speed up any
application by a factor of 10.


Oh, fantasy land again.


Nvidia claims its graphics card has 200-400 cores and can speedup
Applications by a factor of 10-50.

http://apcmag.com/nvidia_lands_cuda_100x_faster.htm


That'll speed up graphics rendering. It has no effect whatsoever on
the performance of a chess engine. And I'd be interested to hear how
going from a single-core to quad-core processor could get you much
more than a factor of four in performance.


Dave.

--
David Richerby Psychotic Pants (TM): it's like a
www.chiark.greenend.org.uk/~davidr/ well-tailored pair of trousers but it
wants to kill you!
  #9   Report Post  
Old January 12th 09, 04:01 PM posted to rec.games.chess.computer
Banned
 
First recorded activity by ChessBanter: Dec 2008
Posts: 2,402
Default chess and grid computing

Nvidia claims its graphics card has 200-400 cores and can speedup
Applications by a factor of 10-50.


http://apcmag.com/nvidia_lands_cuda_100x_faster.htm


That'll speed up graphics rendering. *It has no effect whatsoever on
the performance of a chess engine. *And I'd be interested to hear how
going from a single-core to quad-core processor could get you much
more than a factor of four in performance.


Each processor in a Quad Core process 2 threads at a time So it can
handle 8 threads simulataniously.

Further using Graphics card a few programs can be speed up by a factor
of 10-50.

Bye
Sanny

Play Chess at: http://www.GetClub.com/Chess.html


Reply
Thread Tools
Display Modes

Posting Rules

Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On


Similar Threads
Thread Thread Starter Forum Replies Last Post
Imaginary chess museum and library Chess One[_2_] rec.games.chess.misc (Chess General) 11 August 15th 08 09:16 PM
makruk (Thai chess) - some quick questions [email protected] rec.games.chess.misc (Chess General) 4 January 19th 07 11:40 PM
Top Ten Reasons to Play! Tim Hanke rec.games.chess.misc (Chess General) 19 April 19th 06 08:45 PM


All times are GMT +1. The time now is 09:51 PM.

Powered by vBulletin® Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
Copyright 2004-2019 ChessBanter.
The comments are property of their posters.
 

About Us

"It's about Chess"

 

Copyright © 2017