A note on iterative Hanoi
Bertrand Meyer · ACM SIGPLAN Notices · 1984
A recent note in SIGPLAN Notices [1] presents an iterative solution to the wellknown Tower of Hanoi problem.I would like to mention that an essentially equivalent solution was published several years ago in a book co-authored by Claude R. Baudoin and myself [2, pages 376-378].If I recall correctly, the idea for this solution came during a late night discussion with Patrick Greussay; I have to admit, however, that although all the persons concerned were younger by seven or eight years than they are now, none of us was still in fourth grade, as reported for the discoverer of the solution published in [i].The way we explained our solution in our book is, I think, a little easier to understand than [1].We assume that the reader is familiar with the reeursive version of the algorithm (if not, learn French and buy [2], it's a bargain).Let the call