Comparison of two generalized methods for solving multi-peg towers of Hanoi puzzles
F. O. Ikpotokin, S.C. Chiemeke · Journal of Interdisciplinary Mathematics · 2013
Abstract Two major generalized methods for solving the multi-peg tower of Hanoi problem are considered. These are the dynamic approach of the multi-peg problem as noted in Majumdar [8], and generalized recursive optimal solution for the multi-peg tower of Hanoi by Ikpotokin et al. [3]. It is also shown that the DP approach will utilize more storage space, more number of arithmetic operations and off course more time compare to the second method for the same number of peg t and disk, n.