The Tower of Hanoi Puzzle

LINKS
Miroslav Kolar's
Tower of Hanoi page has all the links, graphical
solvers, nonrecursive programs and empirical performance measurements.

BUY
Programming Books



Jon Louis Bentley,
Programming Pearls, 2nd edition, ACM Press, 1999.
This little book grew out of some puzzles in the Communications of the
ACM. It teaches you how to think as an engineer, meaning how to write
short, fast and errorfree programs. It has great examples and
exercises.


Abelson & Sussman,
Structure and Interpretation of Computer Programs, 2nd edition, McGrawHill, 1996.
This socalled "wizard book" is by far the best introductory book on
computer programming methodology. If you have one semester to show a
curious newbie the various ways of solving problems through programming,
this is the book.


Cormen, Leiserson, Rivest & Stein,
Introduction to Algorithms, 2nd edition, MIT Press, 1990.
CLR is one big heavy comprehensive book on introductory algorithms.
It is a complete reference by itself.
Here is the first edition.


Aho, Sethi & Ullman,
Compilers : Principles, Techniques, and Tools, AddisonWesley, 1985.
The Dragon book on compilers is an engineer's reference. There is
always a time when you have to program the machine to generate other
programs. And you will inevitably open this book to look up parsing,
memory allocation, and other techniques.


Kernighan & Ritchie,
The C Programming Language, 2nd edition, Prentice Hall, 1988.
This is the complete reference on C. There is nothing like it for other languages.


Knuth, The Art of Computer Programming, Volumes 13 Boxed Set, slipcase edition, AddisonWesley, 1998.
These books are intended for somebody who knows some high school algebra
and something about computer programming. But the more you know about
computers and programming, the more you will enjoy these books. They are
about programming in the most elegant, efficient, complete and rigorous way.


Hennessy & Patterson,
Computer Architecture: A Quantitative Approach, 2nd edition, Morgan Kaufmann, 1996.
This book explains how to model the architecture of modern RISCprocessor based workstations, including caching, pipelining and branch prediction.


Lewis & Papadimitriou,
Elements of the Theory of Computation, 2nd edition, Prentice Hall, 1997.
This is a solid treatise on abstract machines and complexity theory. It is
complete with proofs and exercises. This previous edition seems to receive
better reviews.


Sipser,
Introduction to the Theory of Computation, PWS, 1996.
This book is now the most popular among introductory texts in theoretical computing.

