A r e c e n t note in SIGPLAN Notices [1] p r e s e n t s an i t e ra t ive solut ion to the wellknown Tower of Hanoi problem. I would like to men t i on t h a t an essen t ia l ly 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 expla ined our solut ion in our book is, I th ink, a l i t t le eas ier to under s t and t h a n [1]. We a s sume t h a t the r e a d e r is famil iar with the reeurs ive vers ion of t he a lgor i thm (if not, l e a rn F rench and buy [2], i t 's a bargain) . Let the call Hanoi (n, z, y, z) m e a n t r a n s f e r n disks f rom peg x to peg y, using peg z as i n t e r m e d i a t e s torage . The body of the p r o c e d u r e is