Donald Ervin Knuth,
a renowned computer scientist, mathematician, writer, scholar, and Professor Emeritus at Stanford University, California, United States^{[1]}. He is the author of the multi-volume work The Art of Computer Programming, and been called the "father" of the analysis of algorithms - in 1975 he analyzed Alpha-Beta along with Ronald W. Moore, first formulating its Node Types^{[2]}. Beside his fundamental contributions to several branches of computer science and mathematics, Knuth is the creator of the TeX computer typesetting system.

Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.

Knuth

Selected quotes by Donald Knuth ^{[5]}

A mathematical formula should never be "owned" by anybody! Mathematics belong to God.^{[6]}

Beware of bugs in the above code; I have only proved it correct, not tried it.^{[7]}

We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil. ^{[8]}

Home * People * Donald KnuthDonald Ervin Knuth,a renowned computer scientist, mathematician, writer, scholar, and Professor Emeritus at Stanford University, California, United States

^{[1]}. He is the author of the multi-volume work The Art of Computer Programming, and been called the "father" of the analysis of algorithms - in 1975 he analyzed Alpha-Beta along with Ronald W. Moore, first formulating its Node Types^{[2]}. Beside his fundamental contributions to several branches of computer science and mathematics, Knuth is the creator of the TeX computer typesetting system.^{[3]}## Table of Contents

## Quotes

## McCarthy

Quote by John McCarthy fromHuman-Level AI is harder than it seemed in 1955^{[4]}:Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.## Knuth

Selected quotes by Donald Knuth^{[5]}A mathematical formula should never be "owned" by anybody! Mathematics belong to God.^{[6]}Beware of bugs in the above code; I have only proved it correct, not tried it.^{[7]}We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil.^{[8]}## Alpha-Beta

Alpha-Beta F2 and Iterative Solution^{[9]}## See also

## Selected Publications

^{[10]}^{[11]}## 1960 ...

1960).An Imaginary Number System. Communications of the ACM, Vol. 3, No. 41962).The calculation of Easter. Communications of the ACM, Vol. 5, No. 41964).backus normal form vs. Backus Naur form. Communications of the ACM, Vol. 7, No. 12^{[12]}1968 ...).The Art of Computer Programming (TAOCP)^{[13]}Volume 1 - Fundamental Algorithms (

1968)Volume 2 - Seminumerical Algorithms (

1969)Volume 3 - Sorting and Searching (

1973)Volume 4A - Combinatorial Algorithms, Part 1 (

2011)- New material for Volume 4 will first appear in beta-test form as fascicles
- Volume 4 Fascicle 0, Introduction to Combinatorial Algorithms and Boolean Functions (
- Volume 4 Fascicle 1, Bitwise Tricks & Techniques; Binary Decision Diagrams (
- Volume 4 Fascicle 2, Generating All Tuples and Permutations (
- Volume 4 Fascicle 3, Generating All Combinations and Partitions (
- Volume 4 Fascicle 4, Generating All Trees; History of Combinatorial Generation (

Volume 5 - Syntactic Algorithms, planned (estimated in 2020).2008)2009)2005)2005)2006)## 1970 ...

1970).Von Neumann's First Computer Program. ACM Computing Surveys, Vol. 2, No. 41974).Structured Programming with go to Statements. ACM Computing Surveys, Vol. 6, No. 4, pdf » goto1974).Ordered Hash Tables. The Computer Journal, Vol. 171974).Estimating efficiency of backtrack programs. STAN-CS-74-442, CS-Department, Stanford University^{[14]}1974).Surreal Numbers - How two ex-students turned on to pure mathematics and found total happiness. Addison-Wesley^{[15]}^{[16]}1974).Computer Programming as an Art. Communications of the ACM, Vol. 17, No. 121974).Computer Programming as an Art. Turing Award Lecture, pdf1975).Estimating the Efficiency of Backtrack Programs. Mathemathics of Computation, Vol. 29 » Backtracking1975).An analysis of alpha-beta pruning.Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000).Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-31977).Fast Pattern Matching in Strings. SIAM Journal on Computing, Vol. 6, No. 2^{[17]}## 1980 ...

1981).Algorithms in Modern Mathematics and Computer Science. Proceedings, Urgench, Uzbek SSR, September 16-22, 1979. Lecture Notes in Computer Science, Vol. 122, Springer » Ershov Archive1985).An Analysis of Optimum Caching. Journal of Algorithms, Vol. 61986).TeX: The Program. Addison-Wesley^{[18]}1986, 1996).The TeXbook. Addison-Wesley, pdf1989, 1994).Concrete Mathematics. Second Edition, Addison-Wesley## 1990 ...

1991).Serial Isogons of 90 Degrees. Mathematics Magazine, Vol. 64, No. 51991).Textbook examples of recursion. arXiv:cs/9301113 » Recursion1992).Literate Programming. CSLI lecture notes series 27^{[19]}1996).Selected Papers on Computer Science. CSLI lecture notes series 591999).Digital Typography. CSLI lecture notes series 78## 2000 ...

2000).Dancing Links arXiv:cs/0011047v1.2000).Selected Papers on Analysis of Algorithms. CSLI lecture notes series 1022001).Arithmetik. Springer, ISBN 978-3-540-66745-22003).Selected Papers on Discrete Mathematics. CSLI lecture notes series 1062003).Selected Papers on Computer Languages. CSLI lecture notes series 1392003).Things a Computer Scientist Rarely Talks About. CSLI lecture notes series 202## 2010 ...

2010).Selected Papers on Design of Algorithms. CSLI lecture notes series 191, Cambridge University Press, ISBN 978-1-57586-582-92011).Selected Papers on Fun and Games. CSLI lecture notes series 192, Cambridge University Press, ISBN 978-1-57586-584-32012).Companion to the Papers of Donald Knuth. CSLI lecture notes series 202, Cambridge University Press, ISBN 978-1-57586-634-52012).Satisfiability and The Art of Computer Programming. SAT 2012, Lecture Notes in Computer Science, Vol. 7317, Springer## External Links

## Donald Knuth

## Ershov Archive

Dancing D. Knuth

Khiva, summer hall; dancers, D.Knuth

Andrey Ershov, Donald E. Knuth

Khiva, summer hall; A. van Wijngaarden, Zemaneks, D.Knuth. F.Strassen, B.Trakhtenbrot

## Interviews

## Topics

MMIX News

MMIX from Wikipedia

Metafont from Wikipedia

## Videos

## References

1975).An analysis of alpha-beta pruning.Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000).Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-31999).Digital Typography. CSLI lecture notes series 781974).Structured Programming with go to Statements. ACM Computing Surveys, Vol. 6, No. 4, pdf1975).An Analysis of Alpha-Beta Pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000).Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3, pdf1976).On Numbers and Games. Academic Press## What links here?

Up one level