Complexity of the path multi-peg Tower of Hanoi

Daniel Berend, Amir Sapir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Tower of Hanoi problem with h ≥ 4 pegs is long known to require a sub-exponential number of moves in order to transfer a pile of n disks from one peg to another. In this paper we discuss the Path;, variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h -1)/2 bi-directional interconnections among pegs, here there are only h -1 of them. Despite the significant reduction in the number of interconnections, the task of moving n disks between any two pegs is still shown to grow sub-exponentially as a function of the number of disks.

Original languageEnglish
Title of host publicationProceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
EditorsC. Demetrescu, R. Sedgewick, R. Tamassia
Pages212-215
Number of pages4
StatePublished - 1 Dec 2005
EventSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics - Vancouver, BC, Canada
Duration: 22 Jan 200522 Jan 2005

Publication series

NameProceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Conference

ConferenceSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
Country/TerritoryCanada
CityVancouver, BC
Period22/01/0522/01/05

Fingerprint

Dive into the research topics of 'Complexity of the path multi-peg Tower of Hanoi'. Together they form a unique fingerprint.

Cite this