Towers of Hanoi revisited a nonrecursive surprise
Herbert G. Mayer, Don H. Perkins · ACM SIGPLAN Notices · 1984
We describe a simple algorithm that solves the inherently recursive towers of Hanoi problem via iteration. To demonstrate the feasibility of the solution an implementation in Fortran with generated run-time output is appended.