|Internet-based Distributed Computing Projects|
|News and Articles
Recently Completed Projects Past Projects
Tools Development Platforms Conferences Parody and Fun Sites Links Politics
Teams Books and Journals
|Active Distributed Computing Projects - Puzzles/Games|
These links take you to other project categories on this site:|
Mathematics Art Puzzles/Games Miscellaneous Distributed Human Projects
Collaborative Knowledge Bases Charity
See the bottom of this page for a description of the icons on the page.
|Project Information||Project % Complete||Major Supported Platforms|
uses a Java application that runs through your web browser and uses genetic
algorithms to solve a Traveling Salesman Problem (in a TSP, a salesman must
find the shortest route in which he/she can visit each a set of cities once
and return to his/her starting city).
This project is attempting to solve a problem of 15,122 cities of Germany.
The current record-holders of this problem are
Princeton University and Rice
The client is available for Win32 and Linux and Unix platforms that have the Java 1.3 plugin. It should support users behind firewalls since it uses HTTP for communications.
Help create better chess-playing artificial neural
networks in The Distributed
Chess Project. The project software "implements a genetic algorithm to
train multi-layer-perceptron neural networks on sets of chess positions with
known best continuations (e.g. endgame studies, mate in n moves, white
to move and win, ...)."
The client software can be run as a screensaver or run full-time in the background. It allows you to "view the status of the evolution any time in terms of computation time, current generation, current best fitness and population diversity." It also allows you to connect to the Internet automatically or manually when it finishes a task. It also allows you to "modify the key parameters of the algorithm before a new task starts (e.g. number of generations, population size, number of hidden layers, number of nodes per hidden layer, ...)" if you want to take an active role in shaping its chess-playing neural networks.
The application supports users behind firewalls: all data transfer is done via HTTP. Currently the client is only available for the Win32 platform. Version 2.0 of the client is available as of June 23, 2002.
3 years 177 days total computing time
"seeks to create a massive chess playing computer by
utilizing the idle processing power of networked machines." This project
is an experiment "to allow internet-connected computers to work together to
play a game of chess." On December 17, 2002, the project
completed its first
distributed game of chess without human intervention.
detailed information about the project.
Stage one of the project completed on August 9, 2002. 63,261,631 jobs were completed by 265 Peernode operators for this stage.
Stage two of the project will begin sometime in the near future. People are encouraged to help test the new software as it is developed.
On September 8, 2002, the project announced its intention to attempt a Guinness World Record by creating the world's largest distributed chess computer network. Phase 2 will be the first attempt at the record.
Version 188.8.131.52 of the Windows graphical client is available as of June 3, 2002. Version 184.108.40.206 of the Windows, Linux, and MacOSX command-line clients is available as of June 3, 2002.
|waiting for stage two to begin||
|The following icons may appear in the Supported Platforms section of the table:|