The Classical Tower of Hanoi

This chapter describes the classical TH with three pegs. In the first section, the original task to transfer a tower from one peg to another is studied in detail. We then extend our considerations to tasks that transfer discs from an arbitrary regular state to a selected peg. We further broaden our view in Section 2.4 to tasks transforming an arbitrary regular state into another regular state. For this purpose it will be useful to introduce Hanoi graphs in Section 2.3.