yoyo@home brings existing distributed computing projects to the BOINC world using the BOINC Wrapper technology.
yoyo@home is currently running the following
The M queens puzzle is the problem of placing M chess queens on an M x M chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal.
This subproject produces Sieve Files for the CRUS-project. We are sieving for Riesel/Sierpinski to b conjectures where b<1030. (Form: k*bn-/+1). Sieve files are needed to start testing for primes.
the distributed.net client and runs
BOINC Synergy:
