dear all

I should write recursiv & nonrecursive version of extended Hanoi tower. Extended Hanoi tower is similar the normal one. The difference is that here odd rings are in A (1,3,5) and even rings are in B (2,4,6). Now how we can transfer all of them to one with recursive function & a nonrecursive function!!! (Note 1 is the biggest ring and we can't place bigger one on the smaller one)

Thanks in advance