Towers of Hanoi revisited a nonrecursive surprise

Authors:

Abstract
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.