Solving 36-disc Hanoi Tower stack puzzle! (2179 Years @ 1 Move/Second)

A computer generated animated film on solving 36-disc Hanoi Tower puzzle. Over 68 billion moves to move the entire disc stack from left peg to right peg. At move rate of 1 disc per second, solving the puzzle takes almost 800,000 days (over 2179 years or almost 22 centuries). The clock at upper right corner telling the elapsed time (in seconds, minutes, hours, days, months, years and centuries) since the puzzle started at midnight of the first day of the first month of the first year. (Note: first 10 seconds of movie is frozen to allow you to get familiar what is shown in the scene)

Rules of Hanoi Tower puzzle:

The Tower of Hanoi is a mathematical game or puzzle consisting of three rods and a number of discs of various diameters, which can slide onto any rod. The puzzle begins with the discs stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The objective of the puzzle is to move the entire stack to the last rod, obeying the following rules:

--- Only one disc can be moved at a time.
--- Each move consists of taking the upper disc from one of the stacks and placing it on top of another stack or on an empty rod.
--- No bigger disc can be placed on top of a smaller disc.

Enjoy that video! :-)

-------------------------- About Imaginative Animations ---------------------------------------------

New variety of animated movies added to the channel on a regular basis so subscribe yourself to the channel for new incoming movies.

Any compliments, suggestions, requests or complaints are welcomed by leaving comments. New movies are made as time goes by, sometimes based on these comments.

Due to a tug-of-war between intensive computing times and frequency of movie uploads, 3D details may be compromised by scoping time to make movies. If these movies seem beneficial to your projects, especially making musical ones, feel free to drop a comment.

Please subscribe this channel to watch other animated movies. Once subscribed, you will be informed of new uploaded animated movies. Feel free to share them among friends, colleagues and networks of connections. The larger number of audience the channel provides, the bigger motivations are encouraged to create new animated movie to enjoy yourselves as viewers! The motto of this channel is "Whenever beautiful people benefit creators, creators benefit beautiful people."

Thank you for your time reading and sharing the channel. Happy Imaginative Animations!

[exploding_pineapples]

Generations have labored, wars waged, existential crises solved, all for this very occasion. Today, we have finally moved a stack of 32 disks to this pole.

[mathguy]

the pattern of what disc to move is known as an abacaba pattern. Move disc 1 on a, disc 2 on b, etc. This shows the tower of hanoi with a solution following the abacaba pattern with its middle (highest point) at 9 going a-z and then 0-9.

[matherman]

So it took 10 lifetimes just to move the biggest disc and a total of 21 to do the entire thing. I want to do this irl now

[Higheist]

This is one of those videos I didn't think I needed till now.

[hyperpsych]

The recursive solution to move N disks from A to C is to move N-1 disks from A to B, move the Nth disk from A to C, and then move the N-1 disks from B to A. The obvious base case being with 2 disks.

[mrmurpleqwerty]

The reason it takes so dang long is because to move stack n you have to move the n-1 stack on top of it, move disc n, then move the n-1 stack back on top.

[pmkbadua]

To solve 36 disk, solve 35, move disk 36, solve 35 again. To solve 35, solve 34, move disk 35, solve 34 again, and so on to finish this puzzle.

[duxkhi]

I can solve max 7-8 discs lol, over that I get confused

[PuffleBuns]

me, an intellectual: just move the whole tower at once.

[mathismt]

formula for moves is 2^size of tower (in this case 36) -1

and 2^36 is 68 719 476 736