The towers of hanoi: generalizations, specializations and algorithms

摘要

Some variants of the classical problem ofTowers of Hanoiincorporating new pragmatic constraints are considered. The classical problem is extended to themulti-pegcase. Abatched onlinevariant is also proposed. The case wherein not all disks are distinct is also considered. Recursive algorithms for solving variants of the Towers of Hanoi problem incorporating one or more of the above constraints are proposed and their optimality properties are discussed.