Suppose that there are 2*n disks, How could be Hanoi problem solved if odd numbers are disks on bar "A" and even disks are on bar "B" for minimum movement ? please explain me step by step and give's the function for this problem .
Suppose that there are 2*n disks, How could be Hanoi problem solved if odd numbers are disks on bar "A" and even disks are on bar "B" for minimum movement ? please explain me step by step and give's the function for this problem .