Tower of Hanoi online, free

Tower of Hanoi — one of the most famous logical puzzles in history, surrounded by a fascinating legend and a rich cultural heritage. Despite the simplicity of its construction — three pegs and a set of disks of different diameters — this game stands out for the depth of its logic and the appeal of the myth associated with it. Invented in the 19th century, the Tower of Hanoi quickly gained popularity among puzzle enthusiasts and mathematicians around the world.

Its history deserves attention not only because of its elegant rules, but also thanks to the influence the game has had on the cultures of various countries, educational practices, and even scientific research. In this article we will examine in detail the origins of the Tower of Hanoi, trace the evolution of its form and meaning, share little-known facts, and then move on to a description of the game’s rules and strategies. As a result, you will learn why this puzzle has captured the minds of many generations and why it is still considered a benchmark of intellectual sophistication.

History of the Tower of Hanoi

Origin and author

The Tower of Hanoi puzzle was created in France in 1883 and quickly became known thanks to the unusual combination of simple form and an elegant mathematical idea. Its author was the French mathematician Édouard Lucas — a scholar renowned for his research in number theory as well as for popularizing science through the so-called «recreational mathematics».

However, Lucas preferred to present the game to the public not under his own name, but through the fictional character «Professor N. Claus of Siam» — a mysterious figure who supposedly brought the ancient puzzle from Tonkin (the northern part of modern Vietnam). This mystification, supplemented by a hint of exotic origin, gave the puzzle a romantic aura and made it especially appealing to the European audience of the 19th century, fascinated by «Oriental» legends and curiosities.

Over time, attentive researchers noticed a hidden wordplay. It turned out that the name N. Claus (de Siam) is an anagram of Lucas d’Amiens, and the mentioned «Li-Sou-Stian college» becomes the name of the real Saint Louis lycée in Paris when the letters are rearranged, where Lucas worked as a teacher. Thus, the carefully crafted legend turned out to be a clever riddle in which the author himself left his signature.

The first to publicly reveal this mystification was the French science popularizer Gaston Tissandier. In his publications he showed that behind the figure of the «Chinese mandarin» was Lucas himself, thereby revealing the true origin of the game. This story further reinforced the reputation of the Tower of Hanoi not only as a captivating puzzle, but also as a cultural phenomenon where logic is closely intertwined with symbols and allusions.

The first edition of the game

Initially, the puzzle appeared in France under the name La Tour d’Hanoï (translated as «the Tower of Hanoi») and was accompanied by a printed instruction that explained its mythical origin in a popular form. The set included a wooden base with three vertical pegs and a set of eight disks with holes, differing in size. The choice of exactly eight disks was made by Édouard Lucas himself: such a number seemed sufficiently difficult to keep the game interesting, but at the same time manageable for solving.

Each set was supplied with a small booklet that retold the legend of the tower of golden disks. This artistic element gave the puzzle a special mystical touch and turned it into something more than just a mathematical problem. Thanks to the successful combination of simple construction and a vivid legend, the game immediately stood out among other entertainments and aroused lively interest in the public.

In 1884–1885, descriptions and illustrations of the Tower of Hanoi began to appear in popular magazines. The French publication La Nature printed a version of the «Tower of Brahma» legend, presenting the new puzzle as part of an Eastern myth. In the same year, the American magazine Popular Science Monthly published a note with an engraving depicting the process of solving the task. These publications played an important role in spreading the game beyond France: thanks to the press, it became known in Europe and the USA, which strengthened the Tower of Hanoi’s status as a classic puzzle worthy of attention from both scientists and the general public.

The legend of the Tower of Brahma

A key element of the puzzle’s success was the legend, invented by Lucas himself or perhaps inspired by ancient tales. In this story, the action moves to an Indian temple of the god Brahma (sometimes in retellings — a monastery), where monks or priests perform eternal work: moving 64 disks placed on three diamond rods. According to the tale, these disks were made of pure gold and placed by the god himself at the moment of creation. The rule was strict and unyielding — only one disk could be moved at a time, and a larger one could never be placed on a smaller one.

According to the myth, when all 64 disks are moved from one rod to another, the world will come to an end. In different versions of the legend, the location varies: sometimes in Vietnam, in the city of Hanoi, sometimes in India, in a temple in Benares. Because of this, the game appears both as «the Tower of Hanoi» and as «the Tower of Brahma». In some retellings it is said that the monks make only one move a day, in others — that their work is not limited in time.

However, even if we imagine the fastest scenario — one move every second — humanity supposedly need not worry: to complete the task requires 2^64 – 1 moves, which is about 585 billion years. This period exceeds by many times the age of the Universe known to modern science. Thus, the legend not only gave the puzzle a dramatic tone, but also contained a share of refined humor: it emphasized that the task is extremely difficult, while at the same time giving mathematicians and puzzle lovers the opportunity to «calculate the end of the world» within the framework of a beautiful story.

Spread and development

The game Tower of Hanoi quickly gained popularity in Europe. By the end of the 19th century it was known not only in France, but also in England and North America. In 1889 Édouard Lucas published a small booklet describing the puzzle, and after his death in 1891 the task was included in a posthumous volume of his famous work «Récréations mathématiques». Thanks to this edition, the Tower of Hanoi was finally established as part of the classical heritage of recreational mathematics.

Around the same time, the puzzle began to spread under different names: «the Tower of Brahma», «Lucas’ Tower» and others, depending on the country and publisher. Toy manufacturers in various nations produced their own versions of the set, since Lucas had not patented the invention and the design could be freely copied. In England at the beginning of the 20th century, for example, there were editions under the name The Brahma Puzzle. Surviving copies produced in London by the company R. Journet around 1910–1920 featured on the box the text of the legend about the priests and the 64 golden disks.

In the United States the Tower of Hanoi entered the assortment of popular «scientific toys» and quickly found its place alongside other well-known logical entertainments. The simplicity of the construction — three pegs and a set of disks — made it easy to reproduce, and the variations of the legend made it even more attractive. In the first decades of the 20th century the puzzle spread in thousands of copies and took its place among such classics as the 15-puzzle, and later the Rubik’s Cube (although, of course, the Tower of Hanoi appeared much earlier than the cube).

Immutability of the rules and scientific significance

Since the Tower of Hanoi first appeared, its rules have hardly changed. The basic principle — moving disks strictly one at a time and never placing a larger one on a smaller — has remained exactly as Édouard Lucas formulated it in 1883. The immutability of the rules testifies to the completeness of the original design.

Over time, however, the significance of the game changed: it ceased to be just a refined entertainment and became a tool for various fields of knowledge. Mathematicians noted the regularity of the minimal number of moves: the sequence 1, 3, 7, 15, 31, and so on. This progression turned out to be connected with binomial relations and the binary numeral system, and the very structure of the problem clearly demonstrated the link between logical games and the theoretical foundations of mathematics.

In computer science the Tower of Hanoi became a classic example of recursion — a method in which a problem is divided into several similar subproblems of smaller size. In the second half of the 20th century the puzzle was included in programming courses: students learned, through it, to write recursive algorithms and to see how the elegant decomposition of a complex problem into parts leads to a simple and elegant solution.

Over time the game also began to be used in psychology. The so-called «Tower of Hanoi test» is applied to assess a person’s cognitive abilities, their ability to plan actions and to retain in memory the sequence of steps. Such tasks are used in diagnosing the consequences of traumatic brain injuries, in studying age-related cognitive impairments, and in examining the functioning of the frontal lobes of the brain.

As a result, the Tower of Hanoi went far beyond the boundaries of a 19th-century parlor amusement. Today it is perceived as a universal tool — educational, scientific, and diagnostic. The simple form with three rods and a set of disks became the basis for a whole series of studies, and the game has retained its appeal both for lovers of logical puzzles and for professionals in mathematics, computer science, and psychology.

Geography of popularity

The name Tower of Hanoi directly refers to the capital of Vietnam — the city of Hanoi, although the puzzle has no real Eastern roots and was entirely invented in France at the end of the 19th century. Nevertheless, the exotic tone of the legend proved extremely successful: it gave the game an air of mystery and contributed to its wide distribution. That is why in various countries it became established under a name connected with Hanoi: in the English-speaking world — Tower of Hanoi, in France — Tour d’Hanoï, in Germany — Türme von Hanoi, and so on.

In the Soviet Union the puzzle became known no later than the 1960s: it was included in collections of entertaining problems and in books on recreational mathematics. For several generations of schoolchildren the Tower of Hanoi became a familiar classic, and later received computer adaptations.

Curiously, in Vietnam, although there is no historical evidence of a similar ancient puzzle, the game also spread and became known in translation. Thus, it returned to the country whose name was used in the legend, but now as a European invention.

Today the geography of the Tower of Hanoi’s popularity literally covers the entire world. It can be found in kindergartens, where children practice moving colorful plastic rings, and in university classrooms, where computer science students program the solution of the task as an example of a recursive algorithm. The simplicity of production — just a couple of wooden planks and a set of disks are enough — and the universality of the rules have made this puzzle a true world heritage, recognizable and equally interesting in any culture.

The history of the Tower of Hanoi is rich in detail, but no less interesting are the rare episodes and stories that accompanied its journey and gave it a special color.

Interesting facts about the Tower of Hanoi

• Record number of disks. In museums and private collections there are gigantic versions of the Tower of Hanoi with thirty or even more disks. The minimal number of moves for such a task exceeds a billion, which makes it practically impossible to solve manually. Such sets were not created for playing, but as spectacular exhibits emphasizing the infinite complexity and mathematical depth of this puzzle.
• The tower in popular culture. The Tower of Hanoi has appeared many times in literature, cinema, and television series. In the well-known science fiction short story «Now Inhale» (1959) by the American writer Eric Frank Russell, the main character, awaiting execution by aliens, chooses the Tower of Hanoi as his «last wish». He does this deliberately, knowing about the legendary endlessness of the task. To give the event a competitive character, the aliens turn the puzzle into a duel: two players take turns making moves, and the winner is the one who makes the last. By choosing a tower with 64 disks, the hero essentially guarantees himself an endless reprieve. The game also appears in modern cinema. In the film «Rise of the Planet of the Apes» (2011) the Tower of Hanoi is used as an intelligence test for genetically modified apes: one of them assembles a tower of four rings in twenty moves. Although this is more than the minimal possible number (the optimal solution would have been fifteen moves), the scene emphasizes the mental abilities of the animals and visually demonstrates the complexity of the task. The classic British series «Doctor Who» also referred to this puzzle. In the episode «The Celestial Toymaker» (1966) the Doctor was asked to solve a Tower of Hanoi with ten disks. The condition was extremely strict: he had to make exactly 1023 moves — no more and no less. This number was not chosen by chance: 1023 is the minimal possible number of moves for a problem with ten disks. Thus, the hero had to go through the entire path without a single mistake, which once again underlined the reputation of the Tower of Hanoi as an almost insurmountable challenge even for a time-traveling genius.
• Presence in video games. Interestingly, the Tower of Hanoi has become a kind of «standard puzzle» and has penetrated into the world of video games. The Canadian studio BioWare is known for including a mini-game based on the Tower of Hanoi in many of its projects. For example, in the role-playing game Jade Empire there is a quest where rings must be moved between rods, and similar puzzles appear in the famous series Star Wars: Knights of the Old Republic, Mass Effect, and Dragon Age: Inquisition. These episodes are often presented as ancient mechanisms or trials requiring ingenuity from the hero. The puzzle also appears in classic adventure games, for example, in The Legend of Kyrandia: Hand of Fate one of the mysterious mechanisms is the same Tower of Hanoi, disguised as a magical ritual. Such cameos reinforce the image of the Tower of Hanoi as a universal symbol of a logical task.
• Educational aspect. In addition to legends and entertainment, the Tower of Hanoi has also left its mark on science. In 2013 scholars published the monograph «The Tower of Hanoi: Myths and Maths» (Hinz et al.), which examines in detail the mathematical properties of this puzzle and its variations. It turned out that a whole theory of «Tower of Hanoi graphs» has been built around it, connected with the Sierpinski fractal and other areas of mathematics. In cognitive psychology there exists the «Tower of Hanoi test», which is used to check the executive functions of the brain — the ability to plan and follow complex rules. In medicine this test is used to assess the degree of recovery of patients after brain injuries: the ability to solve the task serves as a marker of the functioning of the frontal lobes and the formation of new neural connections. Thus, a game once sold as an amusing toy became the subject of serious research and even an aid in rehabilitation.

The history of the Tower of Hanoi is a vivid example of how an elegant mathematical idea can turn into a cultural phenomenon. This puzzle was born at the intersection of entertainment and science, became surrounded by myths and symbolism, but did not lose its main attraction — pure logical beauty. From the Parisian salons of the late 19th century to modern classrooms and digital applications, the Tower of Hanoi has retained its status as an intellectual classic. It makes one reflect on the power of recursive thinking, teaches patience and precise planning. After learning its history, one cannot help but feel respect for this small tower of disks — a symbol of the endless search for solutions.

Do you want to feel like a priest holding the fate of the world in your hands, or simply test your logical thinking? In the second part we will tell you how to play the Tower of Hanoi, carefully go through the rules, and share tips for solving this legendary puzzle. May the understanding of its history inspire you as you master the game — an exciting intellectual challenge awaits ahead.

The puzzle gained worldwide fame not only thanks to the legend, but also because of its captivating mechanics. Next we will describe in detail how to play the Tower of Hanoi and reveal some tactical tricks. Try your hand at solving this task — perhaps the process will fascinate you no less than the story of its creation.

Tower of Hanoi — a logical tabletop puzzle for one player (or competitively for two if solved against the clock). The classic set consists of a base with three vertical rods and a set of discs of different diameters (usually 5 to 8 in modern versions). At the start, all discs are placed on the left rod, forming a pyramid where each larger disc lies beneath a smaller one.

The goal of the game — to move the entire pyramid to another rod (most often specified as the far-right one) in the minimum number of moves. The game has no time limit: its duration depends on the number of discs and the player’s experience. For example, the task with three discs can be solved in just a few minutes, while moving eight discs may take up to fifteen minutes of concentrated work. Tower of Hanoi develops logical thinking, attention, and patience, which is why it is equally appreciated by children and adults.

At first glance, Tower of Hanoi looks like an elementary task, but behind its apparent simplicity lies strict logic. By moving the pyramid according to the rules, the player learns in practice the principle of recursion: a large goal becomes achievable if it is broken down into a sequence of smaller steps. This structure develops the ability to plan actions and concentrate, and finishing the game brings a special satisfaction from a clearly constructed solution.

Rules of Tower of Hanoi: how to play

Objective of the game

The player’s task is to move the entire tower — the stack of discs — from the starting rod to another. The original order must be preserved: on the target rod, the discs must form a proper pyramid where each larger element is below a smaller one. In other words, the result must fully reproduce the initial construction, only on a new support.

Equipment

The game uses a base with three vertical rods, conventionally designated A, B, and C. Additionally, a set of n discs of different diameters is needed (n ≥ 3; in the classic version — 8). All discs have holes and can freely move between rods. At the beginning of the game, they are stacked on rod A, forming a pyramid: the largest disc at the bottom and progressively smaller ones above it.

Move rules

• Moving a disc. Each move consists of taking the top disc from a chosen rod and placing it on another. A disc may always be taken only from the top of the stack, so the lower elements remain fixed until they are freed. Moving several discs at once is forbidden: the game is built precisely on sequential steps, where the entire construction is gradually reassembled.
• Size restriction. A larger disc cannot be placed on top of a smaller one. This rule guarantees preservation of the pyramid structure: on each rod the discs must be arranged from top to bottom in ascending size — from the smallest to the largest. When moving, a disc can be placed either on an empty rod or on a disc of larger diameter, thereby maintaining the correct order. Any attempt to violate this condition makes the move invalid.
• Target rod. In the classic version, the goal is to transfer the entire pyramid from the left rod A to the right rod C, with the middle rod B serving as auxiliary. This condition sets the direction and makes the task unambiguous. However, in general, the tower can be moved to any of the two free rods: if it is not specified at the start which is the target, the result will be equivalent — what matters is the exact reproduction of the pyramid in the new place.

Game process

The player makes moves sequentially in accordance with the rules. The first move always involves the smallest disc — only it is free at the start. It can be moved either to the middle or to the right rod. The further course depends on the choice made. The game continues until the entire pyramid is assembled on the target rod.

End of the game

The game is considered solved when the entire tower is moved to the target rod and reproduced in the original order: the largest disc at the bottom and the smallest on top. The final construction must fully correspond to the initial pyramid, only in a new place.

Minimum number of moves

It has been theoretically proven that the optimal number of moves to solve Tower of Hanoi with n discs is 2^n − 1. For small values this is easy to verify: for three discs — 7 moves, for four — 15, for five — 31. For example, eight discs require 255 moves, while ten already require 1023. Any deviation from the optimal strategy increases the number of moves, which is why experienced players aim to follow the minimal path.

Rule variations

The classic version involves three rods and the free movement of a disc to any other rod. However, there are recognized complications and modifications.

• With additional rods. Adding a fourth or fifth rod leads to the search for new algorithms. It is known that with four rods the minimum number of moves is lower than with three (this version is known as Reve’s Puzzle). For example, eight discs can be moved in 129 moves instead of 255. For an arbitrary number of rods there is still no universal formula: the Frame-Stewart Conjecture is used as a guideline, remaining unproven for more than seven decades.
• Cyclic tower. In this version the rods are arranged in a circle, and discs can only be moved in one direction (for example, clockwise), without «jumping over» an intermediate rod. Thus, from rod A a disc can only be moved to rod B, from B to C, and so on. This restriction significantly complicates the strategy and increases the number of moves, although recursive logic remains at the core of the solution.
• Magic triangle. Another variation where the three rods are placed at the vertices of a triangle. The same rules apply (one disc at a time, no large on small), but with an additional condition: the smallest disc moves only clockwise, while all others move counterclockwise. This version is essentially related to the cyclic tower and connected to the use of binary Gray code (Frank Gray): the sequence of disc moves coincides with codes arranged without extra steps.

Despite the differences in variations — additional rods, circular arrangement, or movement restrictions — the main idea remains the same: the structure of the task does not change. This clearly demonstrates the universality of Lucas’s idea: it can be modified and complicated, but the original logic remains transparent and unchanged.

Tips for beginners in Tower of Hanoi

Once the basic rules are understood, a natural desire arises to try solving Tower of Hanoi independently. To make the first steps meaningful, it is useful to rely on proven approaches. Below are practical tips — from simple tactics that quickly help master the basic method, to more refined techniques that help avoid common mistakes and develop one’s skills.

Tactical approaches

Tactical techniques allow structuring the solution of Tower of Hanoi into a clear system of steps. Even if the task seems large, the right strategy turns it into a sequence of simple actions. Below are the main approaches that help organize the game and get closer to the optimal number of moves.

• The «free the large disc» algorithm. The key element of the puzzle is the largest disc. It cannot be moved until all the others above it are removed. Therefore, the solution always consists of two phases: first remove n − 1 smaller discs and temporarily place them on an auxiliary rod, then move the largest disc to the target rod, and finally rebuild the pyramid of n − 1 discs on top of it. This technique is the essence of the recursive method: to move a tower of n discs, one must first solve the same task for n − 1 discs. In practice, this means the player’s attention at each stage should be focused on clearing the way for the largest element.
• The role of the smallest disc. The smallest disc is the most mobile and essentially sets the rhythm of the entire game. There is a strategy where it moves every other turn, alternating with other discs. With an odd number of discs, the first move is always to the target rod (A → C), with an even number — to the auxiliary rod (A → B). Thereafter the small disc moves in a circle: with odd n — clockwise (A → C → B → A ...), with even n — counterclockwise (A → B → C → A ...). This regular pattern automates half the moves and makes the process predictable.
• The only possible move. After each move of the smallest disc, there is exactly one other move that can be made without breaking the rules. This means the strategy boils down to alternation: «small disc → the only allowed large disc → small → only large...». This algorithm guarantees a solution with the minimum number of moves and protects even beginners from mistakes.

Common mistakes of beginners

Even knowing the rules, beginners often make the same mistakes. These errors do not make the task unsolvable but significantly increase the number of moves and take away the elegance of the solution. By understanding the most common mistakes, it becomes easier to see what to avoid and how to build a more efficient strategy.

• Random moves without a plan. A common mistake is moving discs chaotically without an overall strategy. This may work with 3–4 discs, but with 5–6 it leads to dead ends. It is more rational to follow the algorithm right away: free the large disc, move it, and rebuild the pyramid. A deliberate strategy prevents unnecessary moves and saves time.
• Violation of the size rule. Beginners sometimes try to place a larger disc on a smaller one. In a real set such a move is physically possible, but it violates the rules and makes the arrangement incorrect. In digital versions such actions are usually blocked by the program. Always check that the moved disc is placed either on an empty rod or on a larger disc.
• Attempting to dismantle the tower completely. Beginners sometimes try to «unload» all discs onto free rods, assuming it will then be easier to assemble the pyramid on the target rod. The game does not allow this: one of the rods inevitably remains occupied and blocks the moves. The effective path is gradual transfer: move part of the discs to the auxiliary rod, move the key (large) disc, then return the removed part.
• Haste and inattention. Tower of Hanoi is a measured game. Hasty moves lead to missing necessary steps and an increase in the number of moves. Especially at the beginning it is useful to maintain a steady pace, track the state of all three rods, and calculate the consequences of each move in advance; this way it is easier to reach the minimal solution.

Strategies for advanced players

When the basic techniques are mastered and solving the classic tower no longer causes difficulties, the desire arises to try more complex approaches. Advanced strategies help to see the deep mathematical structure behind the simple game, expand the understanding of recursion, and allow tackling tasks with more discs or in modified versions. Below are techniques that develop strategic thinking and make the game a true intellectual challenge.

• Recursive thinking. Once the classic tower with 5–6 discs is mastered, try consciously applying the recursive approach for larger n. Break the task into stages: move the top k discs to the auxiliary rod, move the (n − k)th disc to the target, then return the k discs on top. In the optimal algorithm k is always n − 1. But for practice one can try other options, even if they are less efficient. This exercise helps to understand why the minimal number of moves is 2^n − 1, and to see that each additional disc doubles the number of moves and adds one.
• Binary code and the tower. The moves of Tower of Hanoi can be represented as a sequence of binary numbers. Each disc corresponds to a digit, and its position — to the change of that digit. Here appears the connection to Gray code: when moving from one state to another, only one bit changes, corresponding to moving one disc. This observation is of little help in manual play but makes it possible to see the task as a sequential traversal of all numbers from 0 to 2^n − 1 in binary form. For fun, try implementing the algorithm in a program: this strengthens the understanding of recursion and strategic thinking.
• Solving «blind». Another useful practice is solving Tower of Hanoi without a physical set, by recording the moves. Name the rods A, B, and C and write down the sequence of moves: for n = 2 — A → B, A → C, B → C; for n = 3 — A → C, A → B, C → B, A → C, B → A, B → C, A → C. In these sequences the recursive structure is clearly visible. Understanding the pattern allows solving the task mentally, which develops abstract thinking.
• Additional rods. If the basic version is no longer challenging, try the game with four rods. Here the minimal strategy is not so obvious. For four rods no exact formula is known, and the optimality of several algorithms remains unproven. However, it is known that for 15 discs the minimal solution with four rods requires 129 moves — while with three it would be 32,767. Experiment: to which rods should intermediate stacks be moved, how many discs to use at each stage. This develops a creative approach and provides a deeper understanding of the puzzle’s strategic principles.

The best way to learn to solve Tower of Hanoi is to follow a clear strategy. First, it is useful to master the basic method with three rods, then gradually increase the number of discs, introduce time limits, or try solving «blind». This puzzle is good because it always offers a new level of difficulty and allows further development regardless of the player’s experience.

Once the rules of Tower of Hanoi and the main strategies are mastered, one can move on to practice. The game trains the ability to plan and calculate several steps ahead, develops attention and patience. Even if the first attempts are not always successful, consistency and concentration guarantee success. Tower of Hanoi clearly shows: even the most difficult tasks become solvable if broken down into simple steps and executed sequentially.

The puzzle, created more than 140 years ago, continues to inspire today. By trying to assemble the tower, you become part of a long tradition of enthusiasts of this game — from schoolchildren to mathematics professors. Its universality and depth make Tower of Hanoi a timeless activity that unites generations. Ready to test yourself? Play Tower of Hanoi online right now — free and without registration!