On The Solution Of The Towers Of Hanoi Problem
Hayedeh Ahrabian, Comfar Badamchi, Abbas Nowzari-Dalini · Zenodo (CERN European Organization for Nuclear Research) · 2011
In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2n) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated.