title: Recursion in Towers of hanoi
body: <p>I have read the Towers of Hanoi problem statement and the solution as well. The solution states that when you have to move a set of N disks from A to B, use C as temp and transfer N-1 disks from A to C. Then transfer Nth disk from A to B and then transfer the N-1 disks from C to B. I know that the problem has reduced in size and therefore a contender for implementation  recursively. However, we cannot transfer more than 1 disk at a time. How can we transfer N-1 disks in the first place.</p>