هنر برنامه‌نویسی کامپیوتر، جلد ۴، بخش ۵: مقدمات ریاضی دوباره‌نگری‌شده؛ مقدمه‌ای بر بازگشت به عقب؛ پیوندهای رقصان

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The four volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To continue the fourth and later volumes of the set, and to update parts of the existing volumes, Knuth has created a series of small books called fascicles, which are published at regular intervals. Each fascicle encompasses a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. This fascicle covers three separate topics: Mathematical Preliminaries. Knuth writes that this portion of fascicle 5 "extends the 'Mathematical Preliminaries' of Section 1.2 in Volume 1 to things that I didn't know about in the 1960s. Most of this new material deals with probabilities and expectations of random events; there's also an introduction to the theory of martingales." Backtracking: this section is the counterpart to section 7.2.1 which covered the generation of basic combinatorial patterns. This section covers non-basic patterns, ones where the developer needs to make tentative choices and then may need to backtrack when those choices need revision. Dancing Links: this section is related to 2 above. It develops an important data structure technique that is suitable for backtrack programming described above. This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. This Fascicle Covers Three Separate Topics: 1. Mathematical Preliminaries. Knuth Writes That This Portion Of Fascicle 5 Extends The 'mathematical Preliminaries' Of Section 1.2 In Volume 1 To Things That I Didn't Know About In The 1960s. Most Of This New Material Deals With Probabilities And Expectations Of Random Events; There's Also An Introduction To The Theory Of Martingales. 2. Backtracking: This Section Is The Counterpart To Section 7.2.1 Which Covered The Generation Of Basic Combinatorial Patterns. This Section Covers Non-basic Patterns, Ones Where The Developer Needs To Make Tentative Choices And Then May Need To Backtrack When Those Choices Need Revision. 3. Dancing Links: This Section Is Related To 2 Above. It Develops An Important Data Structure Technique That Is Suitable For Backtrack Programming Described Above-- This first volume begins with basic programming concepts and techniques, then focuses on information structures--the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design