The Towers of Hanoi

Authors Avatar

        

The Towers of Hanoi

The “Towers of Hanoi” is a mathematical game/puzzle consisting of three poles and discs of decreasing radii. The difficulty of the puzzle can be changed by adding or removing discs. The aim is to move the pile of discs from one of three stacks/poles to another.

There are two rules:

  1. You are only allowed to move one disc at a time.
  2. You cannot place a larger disc on top of a smaller disc.

One Disc

At its simplest the puzzle contains only one disc. At this level he game can be completed in only one move.

  • One Disc = One Move

Two Discs

  • See Diagram 1
  • Two Discs = Three Moves

Three Discs

  • See Diagram 2
  • Three Discs = Seven Moves

Predictions and Pattern One

So far I have completed the puzzle with one disc; two discs and three discs. Next I will try four discs, but first I will predict how many moves I can do it in.

Here are the results I have had so far:

  • One disc = One move
  • Two discs = Three moves
  • Three discs = Seven moves
Join now!

The first thing I notice is that for each extra disc you can find the number of moves by doubling the number needed for the previous disc and the adding one.

  • ( 1 x 2 ) + 1 = 3
  • ( 3 x 2 ) + 1 = 7

So for four discs I predict I will take 15 moves as that would be the next result in the pattern.

  • ( 7 x 2 ) + 1 = 15

Four Discs

  • See Diagram 3
  • Four Discs = Fifteen Moves

Predictions and ...

This is a preview of the whole essay