Loading...
Please wait, while we are loading the content...
Similar Documents
Exchanging disks in the tower of hanoi.
| Content Provider | CiteSeerX |
|---|---|
| Author | Stockmeyer, Paul K. Bateman, C. Douglass Clark, James W. Eyster, James W. Clark Cyrus R. Harrison, Matthew T. Loehr, Nicholas A. Rodriguez, Patrick J. |
| Abstract | We examine a variation of the famous Tower of Hanoi puzzle posed but not solved in a 1944 paper by Scorer et al. [5]. In this variation, disks of adjacent sizes can be exchanged, provided that they are at the top of their respective stacks. We present an algorithm for solving this variation, analyze its performance, and prove that it is optimal. Several exercises are listed at the end, ranging in difficulty from elementary to research level. 1 Introduction The Tower of Hanoi puzzle, invented in 1883 by ' Edouard Lucas and described by him in [4, pp. 55--59], has been undergoing a dramatic revival in popularity during the past 10 years, largely due to its use as a programming exercise in elementary computer courses. Many variations on the original puzzle also have been proposed and solved. For an excellent survey, with an extensive bibliography, see [3]. One variation posed in 1944 [5], however, appears not to have been studied. In this paper we present an algorithm for solving this va... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Hanoi Puzzle Respective Stack Several Exercise Research Level Many Variation Adjacent Size Elementary Computer Course Edouard Lucas Dramatic Revival Excellent Survey Extensive Bibliography Original Puzzle Famous Tower Programming Exercise |
| Content Type | Text |
| Resource Type | Article |
