Ask Dr. Math : Tower of Hanoi
Edit Page
Report
Scan day: 17 February 2014 UTC
47
Virus safety - good
Description: Includes a small introduction to the Tower of Hanoi including History. Goes on to talk about different ways of tackling the problem.
Math Forum: Ask Dr. Math FAQ: Tower of Hanoi According to the legend of the Tower of Hanoi (originally the "Tower of Brahma" in a temple in the Indian city of Benares), the temple priests are to transfer a tower consisting of 64 fragile disks of gold from one part of the temple to another, one disk at a time. The disks are arranged in order, no two of them the same size, with the largest on the bottom and the smallest on top. Because of their fragility, a larger disk may never be placed on a smaller one, and there is only one intermediate location where disks can be temporarily placed. It is said that before the priests complete their task the temple will crumble into dust and the world will vanish in a clap of thunder.
Size: 739 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Math Forum: Ask Dr. Math FAQ: Tower of Hanoi |
| Keywords: | tower hanoi rings |
| Description: | How many moves will it take to transfer n disks from the left post to the right post? |
| IP-address: | 144.118.94.19 |