THE TOWERS OF HANOI - GENERALIZATIONS, SPECIALIZATIONS AND ALGORITHMS

Some variants of the classical problem of Towers of Hanoi incorporatin g new pragmatic constraints are considered. The classical problem is e xtended to the multi-peg case. A batched online variant is also propos ed. The case wherein not all disks are distinct is also considered. Re cursive algorithms for solving variants of the Towers of Hanoi problem incorporating one or more of the above constraints are proposed and t heir optimality properties are discussed.