Tower of Hanoi

Add to website Metainformation

Other games

The story behind the game

Tower of Hanoi is not just a logic puzzle but a mathematical riddle with a philosophical undertone. Despite its apparent simplicity, it contains deep ideas of recursion, minimalism, and structural perfection. It is used for learning, testing, meditation, and entertainment.

History of the game

The name Tower of Hanoi first appeared in 1883 thanks to the French mathematician and inventor Édouard Lucas. He was not only an outstanding mathematician but also an enthusiastic science popularizer. It was Lucas who invented the game and introduced it under the resonant name La Tour d’Hanoï, inspired by the image of distant French Indochina.

Édouard Lucas accompanied his puzzle with a legend that became as popular as the game itself. Somewhere in the ancient city of Benares (now Varanasi, India), in the heart of a sacred temple, stands a bronze disk topped by three slender diamond rods — each the height of an elbow and the thickness of a bee. Long ago, angered by disobedient monks, the god Brahma raised this tower and commanded them to move 64 golden disks, stacked in a pyramid, from one rod to another — strictly following the rules, in a fixed order, without the slightest deviation.

Since then, the monks have been tirelessly moving disk after disk for centuries. When the last one is placed in its position, the temple will turn to dust, and the world will disappear with it. But there's no need to worry: according to calculations, moving 64 disks requires 2⁶⁴ − 1 moves — that's over 18 quintillion. Even at a rate of one move per second, the monks would have to work on the task for more than 584 billion years — many times the age of the universe.

Lucas presented his puzzle to the public in 1883 under the pseudonym N. Claus (de Siam), which is an anagram of Lucas d’Amiens — a reference to his hometown of Amiens. The game was released as a wooden set with instructions containing the legend of the temple in Benares and soon spread throughout Europe.

Since the late 19th century, Tower of Hanoi has gradually evolved from a curious novelty into a recognized educational tool. It became an integral part of mathematics courses and is used as a trainer to develop logic, abstract thinking, and planning skills. The puzzle is especially common in teaching programming fundamentals — as one of the most illustrative and understandable examples of recursive thinking. In the 1950s, the tower puzzle entered official university curricula in mathematics departments and later became part of required courses on algorithms and data structures.

A renewed interest in the game arose in the 1980s — this time thanks to developments in cognitive psychology. Researchers began using Tower of Hanoi as a model to study memory processes, attention, executive functions, and decision-making. In neuropsychology, it became an important tool for diagnosing cognitive impairments — including in patients after traumatic brain injuries, strokes, and neurodegenerative diseases. Today, the puzzle is part of standard testing batteries in neuropsychological assessments and is actively used in scientific research.

With the spread of digital technologies, Tower of Hanoi has taken on many new formats. It can be found both as a classic wooden set and in digital apps adapted for computers, tablets, and smartphones. The game is actively used on educational platforms, in online learning systems, and in interactive logic and programming courses.

It appears in classrooms, university labs, clinics, and even in brain-training entertainment games. Its universality and structural precision allow it to be used in various contexts — from elementary education to academic science.

Interesting facts

  • The minimum number of moves required to transfer n disks in the classic version of the puzzle is determined by the formula 2ⁿ − 1. For example, it takes only 7 moves to transfer three disks, while 64 disks require 18 446 744 073 709 551 615 moves — making the task practically unsolvable by hand.
  • The puzzle has many variations: with four or more rods, with restrictions on allowed moves, with colored or double disks, and with more complex solving conditions.
  • In 1983, to mark the game’s centenary, a collectible anniversary edition of La Tour d’Hanoï was released in France — with gilded disks and instructions printed in Latin.
  • Some modern tabletop versions of the game are handmade from rare types of wood and are considered luxury collector’s items.
  • In certain versions with four or more rods, the minimum number of moves is still unknown for all configurations — mathematical study of these variations continues and is seen as a nontrivial challenge in algorithm theory.

Today, more than a century after its creation, Tower of Hanoi remains not just a puzzle but a cultural phenomenon. Beneath its simple structure lies a deep mathematical model, a philosophical allegory, and a tool that continues to inspire — from classrooms to research labs. The history of this game is an example of how imagination and disciplined thought can create something timeless.

Try solving Tower of Hanoi right now — for free and with no registration! The best way to understand it is to start playing. Train your logic, strategic thinking, and patience. You’ve got this!

How to play, rules and tips

The Tower of Hanoi is a game that tests not only logical thinking but also patience. Its uniqueness lies in the fact that the player faces a task requiring precise planning of every move. The rules are very simple, but the solution is sometimes far from obvious. What makes this puzzle special is that it can serve as both a light mental warm-up and a true challenge, especially with a large number of disks.

Game rules

The game set includes three main components:

  • Three vertical rods placed on a single base. These act as supports between which the disks are moved. One of them is used as the starting tower, another as the target tower, and the third as an auxiliary rod.
  • A set of disks of different diameters, usually from three to ten. Each disk must slide easily along the rod, and all differ in size — the larger the set, the greater the difficulty.
  • An initial pyramid in which all the disks are neatly stacked in descending order: the largest at the bottom, the smallest at the top. This tower sits on one of the rods and represents the starting position for the game.

The objective of the game is to completely move the tower from one rod to another, strictly following a few simple but essential rules:

  • Only one disk may be moved at a time.
  • You may only take the top disk from any rod.
  • You may not place a larger disk on top of a smaller one — size order must be preserved.
  • The third rod may be freely used as temporary storage.

These restrictions make the task non-trivial even with a small number of disks and require careful planning several moves ahead.

The minimum number of moves needed to solve it is determined by the formula 2ⁿ − 1, where n is the number of disks.

Tips for playing

In the early levels, when the number of disks is no more than three or four, the puzzle can be solved almost intuitively. But with each additional disk, the difficulty increases exponentially. Here are some helpful tips to make your play more effective:

  • Understand the structure of the task. To move the bottom disk, you must first clear the way by removing all the smaller disks. This logic is the core of the entire puzzle.
  • Think beyond a single move. Don't think step-by-step — build a sequence. Every move is part of a broader plan, not an isolated action.
  • Maintain order. Breaking the correct sequence quickly leads to chaos and extra moves. This is especially important in the middle of the game, where fixing mistakes becomes more difficult.
  • Don’t rush. Even if the solution seems obvious, avoid acting at random. In the Tower of Hanoi, rushing only leads to unnecessary moves — not victory.

One of the best-known and most effective ways to solve the Tower of Hanoi is the recursive approach. Its essence lies in turning a large problem into a sequence of simple, understandable steps. Despite its external simplicity, this method teaches structured thinking, building logic, and mentally visualizing the entire chain of actions.

The foundation is a repeating structure:

  • move n − 1 disks to the auxiliary rod to free up the largest one,
  • move the largest disk to the target rod,
  • move the n − 1 disks from the intermediate rod on top of it.

At each level, the solution looks nearly the same as the previous one, just with fewer elements. This is the essence of recursion — the action repeats itself until it reaches the base case.

This method can be done mentally by thinking through the steps or written down to visualize each stage. For beginners, it's a great way to learn how to build algorithms. And for programmers and technical students, it’s a practical exercise in recursive thinking that translates easily into code.

In addition, the recursive strategy helps develop the ability to solve complex tasks step by step — a useful skill not only in games but also in real life.

The Tower of Hanoi is more than just a game — it’s a mental workout that develops logic, concentration, and strategic thinking. It teaches you not to fear difficult challenges, but to face them calmly, advancing step by step toward your goal. You can start with just three disks, but each level opens up new depths.

Add to website
By embedding this widget, you agree to our Terms of Service
Metainformation
Created by
Sophia Collins
Reviewed by
Yuki Matsumoto
Last updated 05/13/2025