Exchanging disks in the tower of hanoi
Paul K. Stockmeyer, C. Douglass Bateman, James W. Clark, Cyrus R. Eyster, Matthew T. Harrison, Nicholas A. Loehr, P.J. Rodriguez, Joseph R Simmons · International Journal of Computer Mathematics · 1995
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.