Donald E. Knuth     The Art of Computer  Programming   Volume 4,  Combinatorial Algorithms    Links to .pdf files are uncorrected;         published versions are up-to-date.   Some older .ps files are on archive.org,        with links below in red.   Otherwise        red means Postscript, blue means PDF.   My balance at: The Bank of San Serriffe:        0x$1.00,    Financial Fiasco.   Somber essay: Infreq. Asked Quest.,        Letter to Rice, Cartoon.   Interviews: 2014-05-20, 2008-04-25, 2005-09-04,        2001-10-05, 2020-04-16

Volume 4A, Combinatorial Algorithms: Part 1 Title Pre-Fascicle Pages Published (date, pages) .pdf .ps 1.3-4. MMIX (See: MMIX Supplement,               MMIX Home Page, MMIXware) 1 1 140     Vol 1, Fasc 1  (2005-02-24, 144) 7. Combinatorial Searching 0A 0A 83     Vol 4A, Fasc 0  (2008-04-27, 240) 7.1. Zeros and Ones 7.1.1. Boolean Basics 0B 0B 87   7.1.2. Boolean evaluation 0C 0C 67   7.1.3. Bitwise tricks and techniques 1A 1A 122     Vol 4A, Fasc 1  (2009-03-23, 272) 7.1.4. Binary decision diagrams 1B 1B 150   7.2. Generating all possibilities 7.2.1. Generating Basic Combinatorial Patterns 7.2.1.1. Generating all n-tuples 2A 2A 72     Vol 4A, Fasc 2  (2005-02-24, 144) 7.2.1.2. Generating all permutations 2B 2B 66   7.2.1.3. Generating all combinations 3A 3A 65     Vol 4A, Fasc 3  (2005-08-05, 160) 7.2.1.4. Generating all partitions 7.2.1.5. Generating all set partitions 3B 3B 92   7.2.1.6. Generating all trees 4A 4A 87     Vol 4A, Fasc 4  (2006-02-16, 128) 7.2.1.7. History and further references 4B 4B 42   Volume 4A, Fascicles 0-4 (bundled together) 933     Vol 4A, Fasc 0-4  (2009-04-03, 944) Volume 4A, Combinatorial Algorithms: Part 1 883   +xvi     Vol 4A  (2011-01-24, 912) Volume 4B, Combinatorial Algorithms: Part 2 Mathematical Preliminaries Redux 5A 5A 54     Vol 4B, Fasc 5  (2019-12-05, 400) 7.2.2. Backtrack Programming 5B 5B 58   7.2.2.1. Dancing Links 5C 5C 267   7.2.2.2. Satisfiability 6A 6A 318     Vol 4B, Fasc 6  (2015-12-18, 320) Volume 4B, Combinatorial Algorithms: Part 2 736   +xvi     Vol 4B  (2022-10-21, 736) Volume 4C, Combinatorial Algorithms: Part 3 7.2.2.3. Constraint satisfaction 7A 7A 296    Vol 4C, Fasc 7  (2025-02-05, 304) 7.2.2.4. Hamiltonian paths and cycles 8A 8A 39    (2024-02-8) 7.2.2.5. Cliques 8B 8B 8   7.2.2.6. Covers   7.2.2.7. Squares   7.2.2.8. A potpourri of puzzles 9B 9B 49    (2024-05-15) 7.2.2.9. Estimating backtrack costs 9C 9C 26    (2020-08-20) 7.2.3. Generating inequivalent patterns   7.3. Shortest paths   7.4. Graph Algorithms   7.4.1. Components and Traversal 12A 12A 39 7.4.1.1. Union-find algorithms. 7.4.1.2. Depth-first search   7.5.1. Bipartite matching 14A 14A 20   Volume 4D, Recursion 8.1. Recursion 16A 16A 9    Extras:    unpublications Parades and Poly-Bernoulli numbers PB 29

NOTE: The first puzzle in section 7.2.2.8 above is particularly interesting.  See --->

The Enigma. "The first puzzle we shall investigate in this section, was deadly serious. We'll study the Enigma M3, a famous cryptographic machine that was introduced in the 1930s and used by the German army to encipher its communications during World War II. And we'll also look at how Alan Turing and others were able to break its code."