Towers of hanoi problem with arbitraryk≧3 pages
Lu. Xue-Miao · International Journal of Computer Mathematics · 1988
The Towers of Hanoi problem with arbitrary k≧3pegs is an extension of the standard one. In this paper we present a nice recursive algorithm for this extended problem and then analyze its complexity. The analysis is based on a group of integer sequences which are closely related to the complexity of the algorithm and which are also independently significant because they possess some elegant combinatorial properties.