Talk:Knuth's Algorithm X: Difference between revisions

Content deleted Content added
Line 56:
 
Whichever column you pick, you end up with choosing the row B and reducing the matrix to a 1x0 matrix (because both columns get removed, but the row A doesn't). Yet this is a solution to the problem, right? So we should consider a 1x0 matrix to be empty but a 0x1 matrix to be non-empty. Everything works fine if an empty matrix is defined to be any matrix with 0 columns (and considering 0xn and nx0 matrices where n is not 0 as different from the 0x0 matrix in the first place). It is a somewhat peculiar notion of "empty", though, and I'm not quite bold enough to be sure that I've understood everything correctly on such a quick peek here. After all, it's Knuth's paper, and I don't have any citations for any of this. Hopefully someone else has the energy to look at this someday :-) -- [[User:Coffee2theorems|Coffee2theorems]] ([[User talk:Coffee2theorems|talk]]) 23:02, 4 July 2008 (UTC)
 
==Quotation without attribution==
This article directly quotes Knuth's paper without attribution and has apparently done so [https://secure.wikimedia.org/wikipedia/en/w/index.php?title=Knuth%27s_Algorithm_X&diff=next&oldid=63012422 since 2006]. {{small|The article omits Knuth's quotes around "depth first" and one sentence in one of the quoted paragraphs.}} The text ought to be rewritten to avoid copyright problems. [[User:Michael Slone|Michael Slone]] ([[User talk:Michael Slone|talk]]) 03:35, 28 December 2009 (UTC)