Hacker News Reader

For anyone curious, this section is on SAT solving. It's section 7.2.2.2 of TAOCP, and is over 300 pages long. Pretty thorough for a section of backtrack, within a section on generating all possibilities, within a full chapter on combinatorial searching.

View on HN

For what it's worth, I went to a presentation by Knuth on this exact section with a SAT expert who frequently commented how (for the presentation at least), significant amounts of relevant material had not been mentioned, and some techniques introduced were not particularly close to the state of the art, or good for educational purposes.

What I'm saying is that there's plenty of literature on SAT Solving already, and some of it is probably better.

Could you convince this SAT expert to review Knuth's fascicle and send his comments to Knuth? or blog about it for everyone's benefit?

I was reading the proceedings of the 2013 SAT competition and was pleasantly surprised to find Knuth listed as a contestant! It also included a few paragraphs he wrote about his submission.

Reply on news.ycombinator.com