The Little Towers of Antwerpen problem |
| |
| Authors: | Steven Minsker |
| |
| Affiliation: | Department of Computer Science, University of Arkansas at Little Rock, 2801 South University Avenue, Little Rock, AR 72204-1099, USA |
| |
| 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. |
| |
| Keywords: | Analysis of algorithms Towers of Antwerpen Towers of Hanoi Recursion |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
