Knuth's Algorithm X

From Wikipedia, the free encyclopedia

Donald Knuth's Algorithm X, first presented in November of 2000, is a recursive, nondeterministic, depth-first, brute-force algorithm that finds all solutions to the exact cover problem represented by 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.

Algorithm X functions as follows:

If the matrix A is empty, the problem is solved; terminate successfully.
Otherwise choose a column c (deterministically).
Choose a row r such that A_{r, c} = 1 (nondeterministically).
Include row r in the partial solution.
For each column j such that A_{r, j} = 1,

delete column j from matrix A;

for each row i such that A_{i, j} = 1,

delete row i from matrix A.
Repeat this algorithm recursively on the reduced matrix A.

The nondeterministic choice of r means that the algorithm essentially clones itself into independent subalgorithms; each subalgorithm inherits the current matrix A, but reduces it with respect to a different row r. If column c is entirely zero, there are no subalgorithms and the process terminates unsuccessfully.

The subalgorithms form a search tree in a natural way, with the original problem at the root and with level k containing each subalgorithm that corresponds to k chosen rows. Backtracking is the process of traversing the tree in preorder, depth first.

Any systematic rule for choosing column c in this procedure will find all solutions, but some rules work much better than others. To reduce the number of iterations, Knuth suggests that the column choosing algorithm select a column with the lowest number of 1s in it.

1 Example
2 Implementations
3 See also
4 External links

[edit] Example

For example, consider the exact cover problem specified by the universe U = {1, 2, 3, 4, 5, 6, 7} and the collection of sets $\mathcal{S}$ = {A, B, C, D, E, F}, where:

A = {1, 4, 7};
B = {1, 4};
C = {4, 5, 7};
D = {3, 5, 6};
E = {2, 3, 6, 7}; and
F = {2, 7}.

This problem is represented by the matrix:

	1	2	3	4	5	6	7
A	1	0	0	1	0	0	1
B	1	0	0	1	0	0	0
C	0	0	0	1	1	0	1
D	0	0	1	0	1	1	0
E	0	1	1	0	0	1	1
F	0	1	0	0	0	0	1

Algorithm X with Knuth's suggested heuristic for selecting columns solves this problem as follows:

Level 0

The lowest number of 1s in any column is two and column 1 is the first column with two 1s, thus column 1 is selected (deterministically).

Rows A and B each have a 1 in column 1 and thus are selected (nondeterministically).

The algorithm moves to the first branch at level 1.

Level 1: Select Row A

Row A has a 1 in columns 1, 4, and 7. Column 1 has a 1 in rows A and B; column 4 has a 1 in rows A, B, and C; and column 7 has a 1 in rows A, C, E, and F. Thus rows A, B, C, E, and F are removed and columns 1, 4 and 7 are removed. Row D remains and columns 2, 3, 5, and 6 remain:

	2	3	5	6
D	0	1	1	1

The lowest number of 1s in any column is zero and column 2 is the first column with zero 1s, thus this branch of the algorithm terminates unsuccessfully.

The algorithm moves to the next branch at level 1.

Level 1: Select Row B

Row B has a 1 in columns 1 and 4. Column 1 has a 1 in rows A and B; and column 4 has a 1 in rows A, B, and C. Thus rows A, B, and C are removed and columns 1 and 4 are removed. Rows D, E, and F remain and columns 2, 3, 5, 6, and 7 remain:

	2	3	5	6	7
D	0	1	1	1	0
E	1	1	0	1	1
F	1	0	0	0	1

The lowest number of 1s in any column is one and column 5 is the first column with one 1, thus column 5 is selected (deterministically).

Row D has a 1 in column 5 and thus is selected (nondeterministically).

The algorithm moves to the first branch at level 2.

Level 2: Select Row D

Row D has a 1 in columns 3, 5, and 6. Column 3 has a 1 in rows D and E; column 5 has a 1 in row D; and column 6 has a 1 in rows D and E. Thus rows D and E are removed and columns 3, 5, and 6 are removed. Row F remains and columns 2 and 7 remain:

	2	7
F	1	1

The lowest number of 1s in any column is one and column 2 is the first column with one 1s, thus column 2 is selected (deterministically).

Row F has a 1 in column 2 and thus is selected (nondeterministically).

The algorithm moves to the first branch at level 3.

Level 3: Select Row F

Row F has a 1 in columns 2 and 7. Column 2 has a 1 in row F; and column 7 has a 1 in row F. Thus row F is removed and columns 2 and 7 are removed. The matrix is empty, thus this branch of the algorithm terminates successfully.

As rows B, D, and F are selected, the final solution is:

	1	2	3	4	5	6	7
B	1	0	0	1	0	0	0
D	0	0	1	0	1	1	0
F	0	1	0	0	0	0	1

In other words, the subcollection {B, D, F} is an exact cover, since every element is contained in exactly one of the sets B = {1, 4}, D = {3, 5, 6}, or F = {2, 7}.

There are no more selected rows at level 3, thus the algorithm moves to the next branch at level 2.

There are no more selected rows at level 2, thus the algorithm moves to the next branch at level 1.

There are no more selected rows at level 1, thus the algorithm moves to the next branch at level 0.

The algorithm is complete.

In summary, the algorithm determines there is only one exact cover: $\mathcal{S}^*$ = {B, D, F}.

[edit] Implementations

Dancing Links, commonly known as DLX, is the technique suggested by Knuth to efficiently implement his Algorithm X on a computer. Dancing Links implements the matrix using circular doubly-linked lists of the 1s in the matrix. There is a list of 1s for each row and each column. Each 1 in the matrix has a link to the next 1 above, below, to the left, and to the right of itself.