TOWERS OF HANOI 2
The tower of Hanoi puzzle was invented in 1883 by Edouard Lukas and is
widely applicable in computer science and discrete mathematics. The towers of
Hanoi problem are analyzed through the incorporation of a different number of discs
(Klahr and Kotovsky 2013). Considering the analysis, all the exercises aims at
effecting the movement of the discs from one peg to another peg following the
conditions stated in the preceding analysis. The discs utilized in the analysis of the
problem has different radii. The discs are numbered in an increasing order (Danesi
2004). This will, therefore, play an essential role in ensuring total adherence to the
conditions stated during the analysis of the algorithm in finding the solution to the
problem. The steps taken for each unique minimum solution is denoted by the
function 2^n-1 (Joyce & Weems, 2016). The description of the steps will be
achieved recursively through the employment of different conditions for all the
steps for the algorithm processes. Denoting the number of moves as Mn(o), the
recurrence relation will be noted by the following function.
Mn(0) =Mo(n-1)+1+Mo(n-1) for n>0. Considering the case when Mo (0)
=2^n-1. Solutions to the puzzle of the towers of Hanoi problem can be achieved
through the consideration of variations to conditions stated in the towers of Hanoi
problem. As analyzed in the above statements, it is worth noting that the towers of
Hanoi problem can be solved by putting into considerations the above-stated
conditions. The problem thus played an integral role in arriving at the best possible
solution for the problem. The problem has applications on drawing of a deeper
understanding of discrete mathematics concepts and the understanding of most
computer programming concepts and codes.
Towers of Hanoi algorithm problem is often used in computer algorithm
introductory texts for the demonstration of the strengths of recursive processes. To
ensure that the algorithm can work effectively so that the tasks can be solved
(Anderson et al. 2015). The original solutions that were presented for dealing with
the towers of Hanoi problem included the iterative algorithm processes. These
solutions deemed to be less mysterious in comparison to the recursive solutions
that have been initially employed (Danesi 2004). The movement of the smallest disc
is usually ensured in a cyclic order. A transparent and efficient algorithm may be
arrived at through a suitable representation of the towers of Hanoi problem. Bit-
string encoding of the disc moves will play a useful role in the examination of the
towers of Hanoi problem. Through this encoding, constructions can be made in
correlation to the forward iterative algorithm processes (Chen et al., 2015). The bit
string forms an integral part in the analysis of the algorithms utilized for finding the
solution for towers of Hanoi problem.
The problem definition
The towers of Hanoi are a problem where three pegs p1, p2, and p3 and n
number of discs ranging from D1, D2, D3, D4.........Dn, is placed on a peg with the
disc D1 on top of the pyramid. The discs increase from D1 to Dn. The problem
solution aims at ensuring the movement of the disc to pj from pi. The value of i is
not taken as equal to value of i. The solution of the problem is subjectable to the
following conditions.

+13062052269

info@desklib.com

Towers of Hanoi: Recursive Algorithm and Real-World Applications

Contribute Materials

Related Documents