Tower of Hanoi: Five Rings Solution 5.

This video explains how to solve the Tower of Hanoi in the simplest and the most optimum solution that is available. in the Tower of Hanoi there are three Towers and there are some rings on the leftmost Tower so what you have to do is shift all the Rings from the leftmost power to the rightmost tower and there are some rules to follow for that I hope you will understand something from this video I will present you how to solve the Tower of Hanoi for any number of rings in my upcoming videos .So subscribe to my channel thank you

[himanshuatri]

After playing this game again and again and watching the solution i found out the pattern:
(Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move))

So this trick is different for odd number of disk and even number of disk
First check if the number of disk is even or odd:
For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc):
• 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole.
• 2: then again move the smallest disk to middle pole.
• 3: make a move with any other disk .
(Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.)
• 4: now move the smallest disk to first pole.
• 5: make a move with any other disk to any pole.
• 6: repeat from • 1 to • 5 untill you are done.
This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31

For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc )
All the steps are going to be the same as above with just a simple change.
In above sequence we were moving the smallest disk
From first pole to last pole
Then from last pole to middle pole
Then from middle pole to first pole.
We were doing this on every second move.
For even number of Disk the sequence for moving the smallest disk on every second turn will be:
From first pole to middle pole
From middle pole to last pole
From last pole to first pole

All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart)
never quit before reaching the minimum number of moves

Additional information:
If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.

[scareflare]

Came here after the Pagoda Stack puzzle in Genshin Lmao, didn't expect such thing in-game, though it sometimes happens that they show us some irl things in-game, this was unexpected.

[masonjones]

First time I tried it I got it in 37 moves. Just did it again and got 34 moves!

[onyx_vii]

🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨
An easier method I found out for myself is to use the left right method. If all my rings are in column A, then column B would be left, and Column C would be Right. If I want all my rings to go to the 'right' column but dont know which column to start in, I name each ring top to bottom using Right left. Start at right, then next ring will be left, then next ring will be right, etc. The last ring you stop on will start your first move at the right or left Column.
5 rings

Right
Left
Right
Left
Right <---- Move top ring here
A B C

If you want the rings in the 'Left' column, you start counting Left then right instead.

Once thats done, since a big piece cant go on a little ring, put the second ring in column B. Then move the small ring on to Column B as well; giving you space to put the 3rd ring in column C. Your goal now is to move all the pieces in column B to column C as well. Once you do that you'll have room for the 4th ring to go to column B.

[raheemahhafsahm.pangarunga]

Hello sir, is there a mathematical explanation for the moves?
thank you

[shuubhuu]

Hey it's my homework to given my teacher 😎😎

[hypnogri]

Solution in text:
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C
A -> B
C -> B
C -> A
B -> A
C -> B
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C
B -> A
C -> B
C -> A
B -> A
B -> C
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C

[Eduardo_Espinoza]

Damn i miss that old school prompt. :)

[isaacdavidson]

Whats you understand the principle behind this you can solve any amount

[badenurkaraca]

Hello, Can I us this video for lesson?Pleas

[mr.d.o.g]

შენ გენაცვალე ყვერებში შენ გამო ბანაკში მოვიგეთ ❤❤

[sajidmanzoor]

Solve the following puzzle for Tower of Hanoi


· If puzzle can be accomplished in 3 moves with two discs. Use this to work out how many moves would be needed with three discs?



· If puzzle can be completed in 15 moves with four discs. Use this to work out how many moves would be needed with five discs?



· In general, describe a way of working out how many moves are needed when one extra disc is added?



ye kese hoga

[LitoMike]

well i completed 5 rings in 134 moves :/

[charles]

I did it in 31 moves without watching this video

[JesusChrist-yhpi]

Well I can’t remember this. There goes my party trick besides water to wine

[_____OBEYMARKVEFIGEN]

Yes, but too many moves. Put the second one from the bottom on the middle post, and accomplish it in 16 moves, let's see if you have that intelligence