This is a Java implementation of Knuth's Dancing Links algorithm for solving exact cover problems efficiently.
Currently, it can
- Solve an exact cover problem (given an int[][] with 0's and 1's)
- Generate solutions to a sudoku board
Implementation of Knuth's Dancing Links algorithm for exact-cover problems (includes sudoku solver)
JavaMIT
This is a Java implementation of Knuth's Dancing Links algorithm for solving exact cover problems efficiently.
Currently, it can