TOWERS OF HANOI-AN ITERATIVE SOLUTION FOR PARALLEL COMPUTATION

Abstract

This paper deals with a new efficient methodology to solve the Towers of Hanoi in iterative way for parallel computation. The algorithm presented in this paper identifies the disc to be moved and the movement to be performed on each step independently, and hence each step is independent of the previous steps, for example- For 3 discs to be moved from peg A to peg C using peg B maintaining the property of discs to be aligned in ascending order on each peg, the earlier methodologies will calculate the first movement to be carried out first then the second and so on till the last step, however this algorithm can calculate the first, second, third or any step irrespective of the earlier steps. Thus, the algorithm presented in this paper has an extra advantage that it can be implemented through parallel computation which the earlier methodology failed to provide. Thus using this algorithm can reduce the execution time of Towers of Hanoi problem considerably. Also space complexity of this algorithm is not much as compared to previous methodologies