Tidy Towers

The Little Towers of Antwerpen problem is a simple variant of the Towers of Hanoi problem requiring the interchanging of two stacks (black, white) of N rings using the third tower as a spare, subject to the usual rules governing ring movement. An ...

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: ...