| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331361 | Information Processing Letters | 2005 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Steven Minsker,