<p style="margin:0px">In 1962 Donald Knuth sketched out chapter titles for a twelve chapter book on computer algorithms called &quot;The Art of Computer Programming.&quot;&nbsp; Chapter 7 was to cover combinatorial algorithms, algorithms having to do with the arrangement of objects into patterns.</p><p style="margin:0px">&nbsp;</p><p style="margin:0px">As Knuth himself put it:</p><p style="margin:0px">&quot;At that time I decided to include a brief chapter about combinatorial algorithms, just for fun. “Hey look, most people use computers to deal with numbers, but we can also write programs that deal with patterns.” In those days it was easy to give a fairly complete description of just about every combinatorial algorithm that was known. And even by 1966, when I’d finished a first draft of about 3000 handwritten pages for that already-overgrown book, fewer than 100 of those pages belonged to Chapter 7&quot;&nbsp; (from the preface to volume 4A of TAOCP)</p><p style="margin:0px">&nbsp;</p><p style="margin:0px">Well, needless to say he underestimated the scope of the problems and the resources eventually devoted to working on them. This is the second fascicle in volume 4B.</p>