Solving 37-disc Hanoi Tower stack puzzle! (4358 Years @ 1 Move/Second)
Фильм және анимация
A computer generated animated film on solving 37-disc Hanoi Tower puzzle. Over 137 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 1,600,000 days (over 4358 years or almost 44 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!
Пікірлер: 33
At this point I’d just pick up the whole stack and move it across
@ThewOrldIssqUare
Жыл бұрын
Thou shalt not!
@dcgaming3571
Жыл бұрын
Yeah the just break the rule, it's been years stacking 1 by 1
@lovelyshaneonag7844
Ай бұрын
That's Cheating
Really cool design for the clock! Also the editing that shows that moving the last disc once is the exact halfway point was a nice touch.
for the people who are saying "move the whole tower in 1 move" , there is a rule that you cannot move more than 1 disk per move
I like how the cloud of flying discs changes color over time 🌈
very impressive animation, took me a while to get a vague idea how to did this. next level is add motion blur to the discs ;) (i would guess this animation would take much much longer to animate).
How long can it take if there was 38 disk
@migueleduardoesteveleahy
Жыл бұрын
twice as long (~8716 years) . it roughly doubles with every disc . think of it this way . to move the 38th disc to the third pole, you first need to move the 37th disc and everything on top to the second pole , then move the 38th disc , and then move the 37th disc and everything on top again . so you're moving the 37th disc twice , so it takes about twice as long as moving it once
@BenRHarsh
Жыл бұрын
It takes (2^n)-1 moves for n disks in the stack to move the entire stack to a new position. 1 disk is 1 move (2-1), 2 disks is 3 moves (4-1), 3 disks is 7 moves (8-1), 4 disks is 15 moves (16-1), etc.
@mrbajo1
Жыл бұрын
@@migueleduardoesteveleahy x2 +1
@migueleduardoesteveleahy
Жыл бұрын
@@mrbajo1 yes good job !!!!!! i was more concerned with explaining the thought process behind the answer than providing a numerical answer
Just move the whole tower in 1 second.
@timothyrg1840
Ай бұрын
Bro broke the rule
how did you make this
How long does this take? The formula is 2^(the stack size) - 1. 2^37 - 1 = 137,438,953,471 (137.43 billion moves)
Oh hey, it's my sound-a-like! Hi Imaginative Animations! I'm Imaginmations!
Have you figured out designs for showing precession on the clock yet?
@ifalicov
Жыл бұрын
Working on it. The main issue is to show something clearly that many people can dig that.
Que?
It takes 21 lifes just to move the biggest disk and 43 to solve the entire thing
can you make a version that moves in real time🥺pweeeease (jk lmao)
Is this algorithm O(n) in complexity?
@IvanTheTerrifying
Жыл бұрын
number of moves = (2^(number of discs))-1 2^37 is 137,439,853,472, the final number of moves was one less
@Fogmeister
Жыл бұрын
It is exponential in complexity. It’s like O(2^n) which is why it grows so quickly. 3 disks is 7 moves 10 disks is 1023 moves 37 disks is 137 billion moves The general formula for n disks is (2^n)-1
Or you could just lift them all up at once and put them on the other pole.
@timothyrg1840
Ай бұрын
Yes then it would be done but that is not something you can do cuz ok the rules
2:47 LOL
light speed
just remember, if you died before about may 30 2023, you lived a whole life while this computer solved this thing
Now do 38
Not third one!!! I said move it to center!!!😂