Tower of Brahma

Quick Answer: The Tower of Brahma is a wooden logic puzzle, also known as the Tower of Hanoi, with three upright pegs on a base and a stack of discs of decreasing size. The aim is to move the whole stack to another peg, one disc at a time, without ever placing a larger disc on a smaller one.

The Rules and the Pattern

The listing image shows the Tower of Brahma puzzle as a long blue base with three wooden pegs and a stack of coloured discs, largest at the bottom, on one end peg. Only two rules apply: move one disc at a time, taking the top disc from any peg, and never place a disc on top of a smaller one. With these rules the whole stack can be moved to another peg, but the number of moves grows surprisingly quickly as discs are added.

One disc takes one move, two discs take three, three take seven and four take fifteen. Each time a disc is added, the number of moves doubles and one is added: the minimum is 2ⁿ − 1 moves for n discs. The reasoning is recursive. To move n discs, first move the top n − 1 discs out of the way, move the largest disc, and then move the n − 1 discs back on top of it. Students who discover this for themselves have met the idea behind recursive algorithms in computer science.

The name comes from a legend of priests in a temple moving 64 golden discs, with the world said to end when they finish. At one move per second, 2⁶⁴ − 1 moves would take hundreds of billions of years, which makes a memorable lesson about exponential growth. The number of discs supplied should be confirmed at enquiry; starting with three or four and adding more is the usual approach.

Classroom Uses

• Recording the minimum moves for one to five discs and finding the pattern
• Introducing powers of two, sequences and exponential growth
• Explaining recursion before students write their first recursive program
• Logic and patience activities in maths clubs and early-finisher corners

Specifications

Care & Handling

• Keep the discs with the base in a bag or box so none are lost; a missing disc breaks the pattern.
• Wipe wooden parts with a dry cloth and keep them away from water, which swells the wood.
• Check that the pegs stay firmly fixed in the base.
• Store the puzzle flat in a dry cupboard.

Why Choose LabEquip

Maths teachers use the Tower of Brahma to turn an abstract formula into something students discover by hand, and computing teachers use it to introduce recursion. LabEquip lists it in the STEM kits range, and more hands-on resources are in the mathematics school lab collection. Contact us through the contact page for class sets.

Frequently Asked Questions

What is the minimum number of moves for the puzzle?

For n discs the minimum is two to the power n, minus one. Three discs need 7 moves, four need 15, five need 31 and six need 63. Each extra disc roughly doubles the work.

Is the Tower of Brahma the same as the Tower of Hanoi?

Yes. It is the same puzzle under different names. Tower of Brahma refers to the legend of the temple priests moving 64 golden discs, while Tower of Hanoi is the name it was given when it was introduced in France in the nineteenth century.

How can students find the pattern themselves?

Start with one disc and add one at a time, recording the fewest moves each time in a table. Most groups spot that each total is double the previous one plus one, and some notice that each total is one less than a power of two.

Is there a simple strategy for solving it?

Yes. Move the smallest disc every other turn, always in the same direction around the pegs. On the turns in between, make the only legal move that does not involve the smallest disc. This reaches the minimum number of moves.

What does the puzzle teach about computer science?

It is a classic example of recursion: solving a problem by breaking it into smaller copies of the same problem. The three-step solution, move n minus one discs aside, move the largest, then move the n minus one discs back, translates directly into a short recursive program.

Which age group is the puzzle suitable for?

Younger children can solve it with three discs as a logic game, while older students analyse the pattern, prove the formula and program a solution. It works across primary, secondary and computing lessons.

Last Updated: September 2026