Two new variants of the Towers of Hanoi problem are proposed. In both variations,
one is allowed to put a bigger disk directly on the top of a smaller one under
some restrictions. We give procedures to solve these two versions, and prove the
optimality of our procedures. Our solution also resolves a problem, which is
similar to one of our versions, proposed by D. Wood tweenty-four years ago.
DIMACS Home Page