![]() Using the function above, it can be calculated, however, that their task would require 2 to the 64th minus 1, or 18,446,744,073,709,551,615 moves. It is said that when the priests finally complete the puzzle it will usher in the end of the world. The Tower of Hanoi, also called the Tower of Brahma and the End of the World Puzzle, is based on a legend involving an esoteric Buddhist monastery in Vietnam where generations of priests toil to move 64 golden discs between three posts in the center of a prayer hall. The Tower of Hanoi puzzle was developed by French mathematician Édouard Lucas in 1883. For example, a Tower of Hanoi puzzle played with three discs can be solved in seven moves and a five disc puzzle can be solved in 31 moves. The most efficient means to solve the puzzle (the fewest number of moves required) follows the simple function 2^n - 1, where n is the number of discs in the puzzle. Only one disc is allowed to be moved at a time, only the top most disc can be moved from a stack, and larger discs cannot be stacked onto smaller discs. ![]() The rules to the puzzle restrict how discs can be moved from one peg to another. ![]() The puzzle starts with all the discs stacked in ascending order on one peg in a conical tower and the object of the puzzle is to reconstruct the tower onto another peg. The Tower of Hanoi is a puzzle consisting of moving a series of discs of various sizes among three pegs. ![]()
0 Comments
Leave a Reply. |