An iterative optimal algorithm for the generalized tower of hanoi problem

Abstract

The Generalized Tower of Hanoi Problem concerns the transformation of an arbitrary initial configuration of n discs distributed among three pegs to an arbitrary final configuration, subject to the well-known Tower of Hanoi rules.

A very simple iterative solution for this problem is presented, taking a minimal number of disc moves.

Keywords:

• Tower of Hanoi Problem
• optimal algorithm
• iterative solution