Open dvberkel opened 6 years ago
Packing puzzles can be seen as an exact cover problem. Donald Knuth describes the dancing links algorithm to solve the exact cover problem.
Although the algorithm is entirely different and relies on a representation of the problem we haven't used yet, it is worthwhile to take a look into.
The dlx crate can be used for this.
dvberkel
commented
6 years ago
Packing puzzles can be seen as an exact cover problem. Donald Knuth describes the dancing links algorithm to solve the exact cover problem.
Although the algorithm is entirely different and relies on a representation of the problem we haven't used yet, it is worthwhile to take a look into.