Dancing links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. More
"Algorithm X" is the name Donald Knuth used in his paper "Dancing Links" to refer to "the most obvious trial-and-error approach" for finding all solutions to the exact cover problem.
The exact cover problem is represented in Algorithm X using a matrix A consisting of 0s and 1s. The goal is to select a subset of the rows so that the digit 1 appears in each column exactly once. More
gem install dlx
require 'dlx/sparse_matrix'
matrix = Dlx::SparseMatrix.new
matrix.add("1001001")
.add("1001000")
.add("0001101")
.add("0010110")
.add("0110011")
matrix << "0100001"
solutions = matrix.solve- Fork it!
- Create your feature branch:
git checkout -b my-new-feature - Commit your changes:
git commit -am 'Add some feature' - Push to the branch:
git push origin my-new-feature - Submit a pull request :D
See LICENSE