Towers of hanoi problem with arbitrary k≧3 pages

Abstract

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.

Keywords:

• Multipeg Towers of Hanoi
• Algorithm
• Procedure
• Feasible Solution
• Optimal Solution

C.R. Categories:

• F.2.2 Analysis of Algorithms and Problem Complexity
• Nonnumerical Algorithms and Problems-computations on discrete structures