Learning Algorithms With the Hanoi Towers

In this tutorial we will create an educational Kit of the Towers Of Hanoi

The Tower of Hanoi, is a mathematical puzzle which consists of three tower and more than one rings:

These rings are of different sizes and stacked upon in ascending order i.e. the smaller one sits over the larger one.

The mission is to move all the disks to some another tower without violating the sequence of arrangement.

The rules are:

• Only one disk can be moved among the towers at any given time.
• Only the "top" disk can be removed.
• No large disk can sit over a small disk.

The puzzle can be played with any number of disks, although many toy versions have around seven to nine of them. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2^n - 1, where nis the number of disks.

We take out scrapwood and make 5 different circles:

• Biggest 12 cm diameter
• 10 cm diameter
• 8 cm
• 6 cm
• 4 cm

Make sure to mark the center of every circle.

Now we take the marked wood and cut it with the band saw. In our case we used a band saw and the Dremel Motosaw.

We take the 3/4" stick and cut 3 pieces at a length of 12 cm each one.

We sand the edges down with the belt sander.

Now we take every disc we cutted out and drill it in the center with the 3/4" Bit.

For the base we need a rectangular piece of plywood 44cm x 12 cm.

Then we mark the first hole 6 cm from the edge, the next hole 16 cm, and the last one also 16 cm away from the other side/ edge of the base : /--6cm-- + --------16cm-------- + --------16cm-------- + --6cm--/

Now we drill the 3 holes for the sticks at the marked spots, but in this case we don´t drill through all the playwood, we leave 2mm undrilled.

We add some so glue to the holes and then place the sticks inside.

Now we only need to paint the disc and we have our Hanoi Towers.

Here we see Luis explaining how to use the tower.