Tower of Hanoi problem

21st January 2000 at 00:00
In a legendary city in the ancient East monks in a temple have to move a pile of 64 sacred disks from one place to another. The disks are fragile: only one can be carried at a time. A disk may not be placed on top of a smaller, less valuable disk. There is a third place in the temple sacred enough for a pile of disks to be placed there, but that's all. The monks start moving disks between the original pile, the pile at the new place, and the intermediate point, always keeping the largest discs on the bottom and the smallest on the top. The legend says that before the monks make the final move to complet the new pile in the new location, the temple will turn to dust and the world will end. Is there any truth to this legend? In a game based on this legend, you have a small collection of disks and three piles (in the physical version of this game, you place disks with holes in the middle onto posts). The disks all start on the left-hand pile, and you want to move them to the right-hand pile. Because you may never put a disk on top of a smaller one , you have the middle pile for your intermediate resting place as you move discs back and forth.


Log-in as an existing print or digital subscriber

Forgotten your subscriber ID?


To access this content and the full TES archive, subscribe now.

View subscriber offers


Get TES online and delivered to your door – for less than the price of a coffee

Save 33% off the cover price with this great subscription offer. Every copy delivered to your door by first-class post, plus full access to TES online and the TES app for just £1.90 per week.
Subscribers also enjoy a range of fantastic offers and benefits worth over £270:

  • Discounts off TES Institute courses
  • Access over 200,000 articles in the TES online archive
  • Free Tastecard membership worth £79.99
  • Discounts with Zipcar,, Virgin Wines and other partners
Order your low-cost subscription today