Slashdot Mirror


Distributed Chess Computing Project

jcarley writes "Just found an interesting project that is looking to capitalise on the power of unused computing cycles to develop a strong chess playing computer. Given the power in single and dual CPU chess programmes these days, if they can find a good way to efficiently parallel the anaysis this could be interesting. "

4 of 209 comments (clear)

  1. Obligatory comment.. by Dexx · · Score: 0, Funny

    Imagine a Beowulf... wait.. nevermind.

    --
    Feel the fear and do it anyway.
  2. Re:define possible by GigsVT · · Score: 5, Funny

    For example, tic-tac-toe can be easily proven to have this type of solution, and chess might has well.

    Well, that cinches it, everyone knows if you try to get a computer to play Tic-Tac-Toe against itself it will overload and shutdown, thus averting nuclear war.

    --
    I've had enough abrasive sigs. Kittens are cute and fuzzy.
  3. Re:Is it possible to "solve" chess? by ealar+dlanvuli · · Score: 2, Funny

    at last... now we know what those silly mice were trying to compute. Apparently the perfect choss game can be reduced to the number 42.

    --
    I live in a giant bucket.
  4. Re:It's all fun 'n games till... by Anonymous Coward · · Score: 1, Funny
    Nah.

    It's all fun and games until someone accidentally proves there is no god.

    (c.f. Episode BABF22 HOMR of "The Simpsons")