|
Project Information
Members
Featured
Downloads
Links
|
IntroductionThe goal of this project is to implement Donald E. Knuth's recursive Dancing Links (DLX) algorithm as a parallel algorithm. This will enable the workload to be distributed among a network of computer systems using BOINC. By scaling the system in this manner we will be able to solve more complex problems than those which can be solved by a single system. The DLX algorithm solves exact cover problems which includes: Polyomino tiling, Latin square puzzles, Sudoku, n-queens, set packing and set partitioning problems. The "DECS Dance" release contains programs and libraries to generate DLX matrices and run the DLX algorithm on a single computer. DECS was initially developed by Jan Magne Tjensvold as a project in computer engineering at the University of Stavanger. News2008-12-12
2008-05-14
2008-04-24
2007-12-17
2007-12-12
2007-10-04Version 0.2 of the DECS programs and libraries has been released. New additions includes:
2007-10-01Version 0.1 of the dance program and the DLX library has been released. Check the download page for more detail. |