0

# Need a small hint on a programm for Tower of Hanoi

Hi , could u plz give me a piece of advice on the problem ? (Of course there is an obvious algorithm to do it , that I know that..., let f(n) be total number of movements , then it will equal to f(n-1) + 1 + f(n-1) . By solving the recrusion, we'll get 2^(n-1) -1 . That's total movements)

1 Réponse

+ 1

Martin Taylor thanks.