We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
Donald Knuth's Algorithm X and Dancing Links technique is used to solve the exact cover problem. A doubly-circular linked-list is used as the data structure. A details description of the data structure and the algorithms is available in (1). Some changes from the sequential version are made for parallelization. (1) Knuth D. E.: Dancing Links, Millenial Perspectives in Computer Science. (2000) 187-214
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