The little towers of Antwerpen problem
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 optimal algorithm for the problem is presented and its performance is analyzed. &COPY; 2005 Elsevier B.V. All rights reserved.
towers of antwerpen towers of hanoi analysis of algorithms recursion