Question

"The number of moves required to solve a Tower of Hanoi puzzle is 2^n-1, where n is the number of disks."

Can anyone explain me, please, why we use 2^n-1 formula?

Answer 1

Read here: http://www.chessandpoker.com/tower-of-hanoi.html

Answer 2

Thanks, I read it but I want to learn why we use 2^n-1? I know how to solve problem.

Answer 3

http://en.wikipedia.org/wiki/Tower_of_Hanoi

i'm not familiar with this puzzle but Wikipedia talks about how to get 2^n-1

Answer 4

Try this: http://cs.nyu.edu/courses/summer07/G22.2340-001/Presentations/McCann.pdf

Answer 5

http://www.cut-the-knot.org/recurrence/hanoi.shtml

Answer 6

James has asked the proof of this once, but nobody has got the answer I think.

Answer 7

http://www.cs.bgu.ac.il/~shayso/Papers/SOFSEM.pdf

Answer 8

This is a previous post that has included your problem if you want to check it. http://openstudy.com/#/updates/4ef0fc31e4b082f22c0b57d9