Exact closed form algorithm for the four peg tower of Hanoi puzzle
F. O. Ikpotokin · Journal of Interdisciplinary Mathematics · 2009
This paper examines the relationship between the triangular numbers and the fournumbered peg tower of Hanoi puzzle. A different pattern of arranging natural numbers to obtaining the triangular numbers revealed a striking or interesting feature. A further examination of the claim by Dudeney and a rearrangement of Lemma 1 both in the work of Skockmeyer [9] led to a simple exact close form expression for the minimum number of disk moves required to transfer n disks on a four-peg tower of hanoi puzzle.