Skip to Main Content
The Art of Computer Programming, Volume 4B: Combinatorial Algorithms
book

The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

by Donald E. Knuth
September 2022
Intermediate to advanced content levelIntermediate to advanced
736 pages
30h 14m
English
Addison-Wesley Professional
Content preview from The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

Chapter 7—Combinatorial Searching

Nowhere to go but out,

Nowhere to come but back.

— BEN KING, in The Sum of Life (c. 1893)

Lewis back-tracked the original route up the Missouri.

— LEWIS R. FREEMAN, in National Geographic Magazine (1928)

When you come to one legal road that’s blocked,

you back up and try another.

— PERRY MASON, in The Case of the Black-Eyed Blonde (1944)

7.2.2. Backtrack Programming

Now that we know how to generate simple combinatorial patterns such as tuples, permutations, combinations, partitions, and trees, we’re ready to tackle more exotic patterns that have subtler and less uniform structure. Instances of almost any desired pattern can be generated systematically, at least in principle, if we organize the search carefully. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

Donald E. Knuth

Publisher Resources

ISBN: 9780137926862