![]() ![]() If you have not tried to solve this puzzle before, you should try it now. Notice that, as the rules specify, the disks onĮach peg are stacked so that smaller disks are always on top of the larger disks. At a rate of one move per second, that is 584, 942, 417, 355 584, 942, 417, 355 years! Clearly there is more to this puzzle than meets the eye.įigure 1 shows an example of a configuration of disks in the middle of a move from the first peg to the third. When they finished their work, the legend said, the temple would crumble into dust and the world wouldĪlthough the legend is interesting, you need not worry about the world ending any time soon. The priests worked very efficiently, day and night, moving one disk every second. They could only move one disk at a time,Īnd they could never place a larger disk on top of a smaller one. Their assignment was to transfer all 64 disks from one of the three poles to another, with two important constraints. Poles and a stack of 64 gold disks, each disk a little smaller than the one beneath it. At the beginning of time, the priests were given three He was inspired by a legend that tells of a Hindu temple where the puzzle was presented to young priests. The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas in 1883. ![]()
0 Comments
Leave a Reply. |