Revision as of 20:20, 24 December 2007 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits m →External links: replace section name ← Previous edit		Revision as of 15:31, 7 March 2008 edit undo MarSch (talk \| contribs) Extended confirmed users 8,554 edits Donald Knuth's Next edit →
Line 1: [[Donald Knuth~~\|Donald Knuth's~~]]'s '''Algorithm X''', first presented in November of 2000, is a [[recursion (computer science)\|recursive]], [[Nondeterministic_algorithm\|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.

Knuth's Algorithm X: Difference between revisions