How many discs?
I was playing Towers of Hanoi. The game consist of a certain number of discs of different sizes that i have to move from stick
to stick
, in such form that in no moment of the game a disc that is bigger than other is above from it.
I was playing with discs, i made a perfect game. If I counted movements. What is the value of ?
Note:
- A perfect game is considerated to do the minimum quantity of movements.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Situation 1 we know that the number of move to move 1 disk from post A to C is 1.Situation 2 (2 discs), the number of moves to remove 2 discs to C is three. Situation3 (3 discs) the number of moves to remove 3 discs to C is 7. From this we see that it forms a recursive pattern of 2^n-1 where n is the number of discs. Therefore N=7 and N^2=49.