Also, let's the number the disks from the smallest disk to the largest disk serially. Let's name the towers as Tower-1, Tower-2 & Tower-3. The ProblemĪccording to the historical puzzle, in the modern computer science there is a recursion problem where you are given 03 pegs/towers and N disks with increasingly different sizes. The Tower of Hanoi also called as Tower of Brahma or Lucas Tower. The temple may be said to be in different parts of the world including Hanoi, Vietnam which is may be associated with any religion. However, it's not clear that how Édouard Lucas invented this legend or was inspired by it. It's said that if the last move of the puzzle would be completed, the world would be dead! Anyway, there are many variations in this story. The principle rule is they could move one disk at a time and could't place a larger disk on top of a smaller one. According to the story, the Brahmin priests were abiding by the command of an ancient prediction to move these 64 disks from source tower to destination tower.
Basically, it's a mathematical game/puzzle was invented by the French mathematician Édouard Lucas in 1883.Īccording to the wikipedia note there is a story about a temple containing a large room with 03 towers are surrounded by 64 golden disks in a place of India namely Kashi Vishwanath. Tower of Hanoi is a popular topic to study the recursion based algorithm.
0 kommentar(er)
