The towers of Hanoi: yet another nonrecursive solution

In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs ...

This paper studies parallelism for the multipeg Towers of Hanoi problem, an interesting generalization of the traditional one, by allowing concurrent moves of discs in a single step. Three versions of parallelism are investigated based on two factors: ...

By decomposing the recursive solution established in [1] into what we call sectors, a nonrecursive solution is obtained for the parallel multipeg Towers of Hanoi problem. The decomposition discloses more inherent properties of the existing recursive ...