Scribd
Upload
18 views

Tower of Hanoi: Jump To Navigationjump To Search

The Tower of Hanoi is a mathematical puzzle that consists of three rods and a number of disks of different sizes that can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod. The objective is to move the entire stack to another rod, obeying the rules that only one disk can be moved at a time, each move involves taking the upper disk from one stack and placing it on another, and no larger disk can be placed on top of a smaller disk. With 3 disks, the puzzle can be solved in 7 moves, and the minimal number of moves required to solve an n-disk Tower of Hanoi is 2n - 1. For an 8

Uploaded by

Naveed Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Tower of Hanoi: Jump To Navigationjump To Search

The Tower of Hanoi is a mathematical puzzle that consists of three rods and a number of disks of different sizes that can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod. The objective is to move the entire stack to another rod, obeying the rules that only one disk can be moved at a time, each move involves taking the upper disk from one stack and placing it on another, and no larger disk can be placed on top of a smaller disk. With 3 disks, the puzzle can be solved in 7 moves, and the minimal number of moves required to solve an n-disk Tower of Hanoi is 2n - 1. For an 8

Uploaded by

Naveed Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Tower of Hanoi

From Wikipedia, the free encyclopedia


Jump to navigationJump to search
Not to be confused with Keangnam Hanoi Landmark Tower.

A model set of the Tower of Hanoi (with 8 disks)

An animated solution of the Tower of Hanoipuzzle for T(4, 3)

Tower of Hanoi interactive display at the Universum museum in Mexico City

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower[1] and sometimes
pluralized) is a mathematical gameor puzzle. It consists of three rods and a number of disks
of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat
stack in ascending order of size on one rod, the smallest at the top, thus making
a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following
simple rules:

1. Only one disk can be moved at a time.


2. 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.
3. No larger disk may be placed on top of a smaller disk.
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to
solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.

If you consider it takes 1 second to move a single disk while playing the Tower of Hanoi,
and there are a total of 8 disks, then the minimum number of moves needed to complete
the game is 255, and it will take 3 minutes and 15 seconds.

You might also like