On a question of Leiss regarding the Hanoi Tower problem

Citations of this article
Mendeley users who have this article in their library.


The Tower of Hanoi problem is generalized in such a way that the pegs are located at the vertices of a directed graph G, and moves of disks may be made only along edges of G. Leiss obtained a complete characterization of graphs in which arbitrarily many disks can be moved from the source vertex S to the destination vertex D. Here we consider graphs which do not satisfy this characterization; hence, there is a bound on the number of disks which can be handled. Denote by gn the maximal such number as G varies over all such graphs with n vertices and S, D vary over the vertices. Answering a question of Leiss [Finite Hanoi problems: How many discs can be handled? Congr. Numer. 44 (1984) 221-229], we prove that gn grows sub-exponentially fast. Moreover, there exists a constant C such that gn ≤ Cn1 / 2 log2 n for each n. On the other hand, for each ε > 0 there exists a constant Cε > 0 such that gn ≥ Cε n(1 / 2 - ε) log2 n for each n. © 2006.




Azriel, D., & Berend, D. (2006). On a question of Leiss regarding the Hanoi Tower problem. Theoretical Computer Science, 369(1–3), 377–383. https://doi.org/10.1016/j.tcs.2006.09.019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free