Tower of Hanoi

This problem is interesting and can be solved by recursive algorithm.
The link is:
http://en.wikipedia.org/wiki/Tower_of_hanoi
The number of ways for n weights is 2^n-1.
The logic is yet to be found by me on net or elsewhere...