On uniqueness of solution to the multi-peg towers of hanoi

Abstract

The multi-peg Towers of Hanoi problem is still open. No provably optimal constructive algorithm to solve the problem is known. The minimum number of moves required is also unknown. Though optimal solutions are observed to be non-unique, the exact uniqueness criteria of an optimal solution are little known to the literature. This paper revisits a deterministic algorithm conjectured to optimally solve the problem and addresses the uniqueness characteristics of an optimal solution.

Keywords:

• Towers of Hanoi
• Combinatorial problem
• Design of algorithm
• Recursive formulation
• Dynamic programming
• Combinatorial explosion

C.R. Categories:

• F2.2
• G2.1

^*Visting the Department of Computer of the University of Miami, USA during the academic session 2000-2001. [email protected] [email protected]

^*Visting the Department of Computer of the University of Miami, USA during the academic session 2000-2001. [email protected] [email protected]

Notes

^*Visting the Department of Computer of the University of Miami, USA during the academic session 2000-2001. [email protected] [email protected]