Write a script that I will approve before starting the animation then produce an animation that will demonstrate teh tower of hanoi principle. More or less from the content of these two pages :
[login to view URL] & [login to view URL]
n order to get a story more or less as bellow:
The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas in 1883. He was inspired by a legend that tells of a Hindu temple where the puzzle was presented to young priests. At the beginning of time, the priests were given three poles and a stack of 64 gold disks, each disk a little smaller than the one beneath it. Their assignment was to transfer all 64 disks from one of the three poles to another, with two important constraints. They could only move one disk at a time, and they could never place a larger disk on top of a smaller one.
The priests worked very efficiently, day and night, moving one disk every second. When they finished their work, the legend said, the temple would crumble into dust and the world would vanish.
Although the legend is interesting, you need not worry about the world ending any time soon. The number of moves required to correctly move a tower of 64 disks is 264−1=18,446,744,073,709,551,615264−1=18,446,744,073,709,551,615. At a rate of one move per second, that is 584,942,417,355584,942,417,355 years! Clearly there is more to this puzzle than meets the eye.
How do we go about solving this problem recursively? This is where an algorithm can come in handy
To write an algorithm for Tower of Hanoi, first we need to learn how to solve this problem with lesser amount of disks, say → 1 or 2. We mark three towers with name, source, destination and aux (only to help moving the disks). If we have only one disk, then it can easily be moved from source to destination peg…..
The style could be similar to this :
I prefer After Effect than whiteboard
34 freelancers are bidding on average $496 for this job
Hello, We can work towards your specified requirements. Well described , thanks for the Reference for quality from you. Kindly refer to [login to view URL] Thank you, Theerthana.