TY - GEN

T1 - Complexity of the path multi-peg Tower of Hanoi

AU - Berend, Daniel

AU - Sapir, Amir

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=32144461737&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:32144461737

SN - 0898715962

T3 - Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

SP - 212

EP - 215

BT - Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

A2 - Demetrescu, C.

A2 - Sedgewick, R.

A2 - Tamassia, R.

T2 - Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Y2 - 22 January 2005 through 22 January 2005

ER -