Question

please help thank you

Answer 1

Answer:

  3 moves

Step-by-step explanation:

The diagram accompanying the problem statement shows you the answer.

_____

Comment on the problem statement

The problem as given does not limit the number of disks that can be moved at once. If you assume you can move more than one disk at a time, then the stack can be moved in one move: pick up the whole stack and put it on a different peg.

The classic puzzle restricts moves to a single disk at a time, and also requires that a disk only be put on top of one that is larger.

Answer 2

Answer:

Three

Step-by-step explanation:

In general, the more disks you have, the more moves it will take. This is a very ancient puzzle. Legend has it that there is a group of monks in one of the far east countries that has this puzzle with three pegs and 64 golden rings on one of them. The object for them is the same as this simple one is for you -- move all 64 rings from 1 peg to one of the other 2 pegs.

The rules are simple:

1. Only one disk can be moved at a time.
2. Only smaller disks can be put on larger ones. There is no such thing as a larger one going on a smaller.

Two more comments.

The number of moves minimum = 2^number of disks - 1

So for the problem you were given 2^2 - 1 is the number of moves you need. which 2*2 - 1 = 4 - 1= 3

This puzzle is made commercially and comes with 7 rings.

2^7 - 1 = 2*2*2*2*2*2*2 - 1

2^7 - 1 = 128 - 1 = 127

Legend has it that the tower Hanoi (which is what this puzzle is called)  would take the monks (if they could make a move a second)  about 5 with 11 zeros behind it years to complete the task