Splitting tower of Hanoi into odd even disks
S.S. Maniccam · Journal of computing sciences in colleges · 2015
This paper addresses a Tower of Hanoi related problem. The problem is to split a tower of disks into a tower of odd numbered disks and a tower of even numbered disks. There are three poles and the standard rules of disk movement apply. Two algorithms to solve the problem are presented. The first algorithm is easy to design and analyze. It uses direct recursion. The second algorithm is a better algorithm but it is more complex. It involves two other splitting problems. The three splitting problems are solved by three functions which call each other in a circular order resulting in indirect recursion. Analysis of the three coupled recursive functions involves three simultaneous recurrence equations which are solved iteratively.