A simple iterative algorithm for the towers of Hanoi problem

Abstract

The towers of Hanoi game is well known. The basic version, a favorite example for many authors, is often used in introductory textbooks on computer programming to demonstrate the elegance of writing recursive code. Here, a simple iterative optimal algorithm for the towers of Hanoi problem is presented.