Papalocal
Loading…
Papalocal · Things
Work

Tower of Hanoi

Tower of Hanoi is a mathematical game or puzzle. It came out in 1883.

Came out
1883
Country of origin
French Third Republic
All 6 facts, and where they come from

Facts

6 facts · 0 confirmed by two sources · 0 cited · 6 from one source

What it is
mathematical game One source
mechanical puzzle One source
mathematical puzzle One source
Country of origin
French Third Republic One source
Came out
1883 One source
Named after
Hanoi One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2532190723
Described as
mathematical game or puzzle
Other names
Tower of Brahma, Towers of Hanoi, The problem of Benares Temple, Lucas' Tower, pyramid puzzle
What it is
mathematical game; mechanical puzzle; mathematical puzzle
Country of origin
French Third Republic
Came out
1883
Named after
Hanoi
Wikipedias with a page
48

Wikidata item Q213593 (wikidata.org/wiki/Q213593), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1384097997

The Tower of Hanoi
(also called ToH, Lucas's Tower, Tower of Brahma, or the problem of Benares Temple, and sometimes pluralized as Towers, or simply the pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules:

Only one disk may be moved at a time.
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
No disk may be placed on top of a disk that is smaller than it.
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks. The puzzle game was named after the capital city of today's Vietnam.

From the Wikipedia article “Tower of Hanoi” (en.wikipedia.org/wiki/Tower_of_Hanoi), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

Picture: Wikimedia Commons: Tower of Hanoi 4.gif · See Commons file page

People connected 1

Known for it