(Towers of Hanoi) Modify Listing 15.8, TowersOfHanoi.py, so that the program finds the number of moves needed to move n disks from tower A to tower B.
(Hint: Use a global variable and increment it for every move.)
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.