The Classical Tower of Hanoi

Andreas M. Hinz (), Sandi Klavžar (), Uroš Milutinović () and Ciril Petr ()
Additional contact information
Andreas M. Hinz: LMU München, Faculty of Mathematics, Computer Science and Statistics, Institut für Mathematik
Sandi Klavžar: University of Ljubljana, Faculty of Mathematics and Physics
Uroš Milutinović: University of Maribor, Faculty of Natural Sciences and Mathematics
Ciril Petr: University of Maribor, Faculty of Natural Sciences and Mathematics

Chapter Chapter 3 in The Tower of Hanoi – Myths and Maths, 2013, pp 71-130 from Springer

Abstract: Abstract 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.

Keywords: Short Path; Span Tree; Recurrence Relation; Optimal Path; Induction Assumption (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0237-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9783034802376

DOI: 10.1007/978-3-0348-0237-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().