Further development in multi-peg tower of Hanoi algorithms

F. O. Ikpotokin · Journal of Interdisciplinary Mathematics · 2008

In this paper a simplified rule for the solution of a 4-numbered peg is presented. It uses a simple recurrence relation derived from a further probe into the result of an earlier work [1]. Also an implementation of the algorithm in this paper and that in [2] was achieved using two conventional programming languages.

Read the paper · More papers on PaperTik