Talk:Knuth's Algorithm X: Difference between revisions

Revision as of 15:53, 29 January 2006

Revision as of 16:54, 27 June 2006

Line 20:

:''The above discussion is preserved as an archive of the debate. <font color="red">'''Please do not modify it.'''</font> Subsequent comments should be made in a new section on this talk page. No further edits should be made to this section.</div><!-- Template:pollbottom -->

== Reorganize Exact cover, Algorithm X and Dancing Links articles? ==

The [[exact cover]], [[Algorithm X]] and [[Dancing Links]] articles all discuss similar ideas. The exact cover problem is an [[Np_complete|NP-complete]] problem; Algorithm X is a [[brute-force]] [[algorithm]] that finds all solutions to the exact cover problem; and Dancing Links is a computer implementation of Algorithm X. These related topics have received a lot of interest recently because Dancing Links is the preferred technique for solving [[Sudoku]] puzzles quickly by computer. I suggest that all three topics be reoganized so that most of the information about concepts and examples is in the [[exact cover]] articles, with the other two articles focusing just on the particulars of the algorithm or the computer implementation. --[[User:Rob Zako|Rob Zako]] 16:54, 27 June 2006 (UTC)