Quick Answer: The Tower of Brahma, also known as the Tower of Hanoi, is a mathematical puzzle in which a graduated stack of discs is moved from one peg to another under fixed rules.
Last updated: October 2026
Key Features
Only one disc moves at a time, and only from the top of a stack
A larger disc may never be placed on a smaller one
Uses a start peg, a destination peg and a third peg as an intermediate position
Minimum number of moves for n discs is 2^n − 1, illustrating exponential growth
Gives a physical example of recursion and algorithmic thinking
About This Product
Students begin with all discs on one peg, largest at the bottom, and transfer the whole stack to a chosen destination peg. Recording the total moves and comparing them with the theoretical minimum turns the activity into a lesson on powers of two, sequencing and recursive solutions. The puzzle suits mathematics laboratories, maths clubs, competitions and enrichment sessions that build logical reasoning and planning. Besides buyers across India, the Tower of Brahma can be exported to institutions in Democratic Republic of the Congo, Brazil, Slovenia, Maldives, Lithuania and Belarus.
Frequently Asked Questions
Q1. How many moves does the puzzle need? The theoretical minimum is 2^n − 1 moves, where n is the number of discs. The sharp rise in moves as discs are added is used to teach exponential growth and powers of two.
Q2. Is the Tower of Brahma the same as the Tower of Hanoi? Yes. Tower of Hanoi is the alternative name for the same puzzle, played with the same rules of moving one disc at a time and never placing a larger disc on a smaller one.
.png)
.png)
.png)
 (1).png)
.png)
 (1).png)
 (1).png)
.jpg)