NQueens

The original eight queens problem consisted of trying to find a way to place eight queens on a chessboard so that no queen would attack any other queen. An alternate way of expressing the problem is to place eight anythings on an eight by eight grid such that none of them share a common row, column, or diagonal.

In the N Queen problem the number of solutions and the time taken to solve the whole problem increases in order of n!. So doing it on a single ordinary PC it's a marathonic problem after N=19.

But, due the nature of the problem, it's a perfect candidate for paralelization. That's done by placing Queens in all different positions of the first Col/Row of the board, and then solve the results problems. The solution of the original problem it's the sum of all solutions of the subproblems.

This project it's an attempt to find the results of the NQueen problem using a BOINC framework for board sizes starting from N=19.