Tower of Hanoi: Seven Rings(Disks) Solution 7.

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

[@seanappleby2253]

I just had a stroke watching this

[@Fervorazzi]

Madam Faruzan brought me here. Answer is 127 steps. 😅

[@NickilyNoob]

I knew I can't be the only one looking for this after granny's lesson xD

[@MuhammadAiman-jv8yi]

(2^n)-1

[@user-hi1tk4ez7i]

It's amazing!

[@lziv7583]

If your stack the stack you’re trying to move is an odd number place the first ring on the tower you are trying to move that stack to and if it’s even place the first ring on to the other tower that the ring isn’t already on.

[@schildknaap_van_gent]

I solved this in 3 minutes 40 seconds 127 steps

[@lakshyachoudhary2956]

Amazing video bro🤗🤗🙂🙂

[@UrGuru]

+lakshya choudhary thnks

[@spacenumber1149]

Granny Faruzan bring me here

[@togomori3008]

Thank you thank you thank you thank you a lot.

[@user-yf5jg7do2o]

Thank you

[@UrGuru]

You're welcome

[@himanshuatri9117]

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.

[@hanaleiso5433]

Thx

[@nouranour7519]

Good ..
i do it in 165 moves

[@sarahortega6482]

159 here.

[@blueberryy4702]

I followed this exactly but the app I used didn’t say I finished it :(

[@barbieq4222]

Can do it with just 52 sec (phone) and 127 moves (phone)
But 2:07 (real, because some disk roll away) and also 127 moves

[@chrislersonmaglalang9493]

My friend can do 35sec, sometimes 30 sec

[@zangetsu5324]

I did it with 67 moves

[@siarya_math]

​​@@zangetsu5324I don't believe you. 127 is the minimum number of moves to solve tower of Hanoi for 7 disks

[@keyskings7058]

I did ten in an hour.

[@miki957]

Yeah I just did 7 in 404 moves

[@nikunjkrishnarayal]

Code?

[@eleonorafernandes]

Aren't we supposed to involve the second peg in every move???

[@UrGuru]

Nope

[@eleonorafernandes]

@@UrGuru thanks for d info

[@tinytyun1514]

i did 7 disk with 127 moves, did i get it wrong? 💀

[@pattytheratty]

nah 127 is the best you can do

[@maricellumakin6521]

I want too know because im in that game

[@godwinenilama6913]

I did it in 126 move

[@maximume4t210]

92 moves with my girlfriend😊

[@tegarwisnuk.a7161]

Impossible, bcz min move is 127 to solve 7 disk

[@orange6167]

confusing

[@UrGuru]

hello hello I m going to publish the ways to do it very soon...
Will solve your problem

[@averycertainnobody]

POV: You're in grade 8

[@Missaigon]

Its too fast

[@UrGuru]

There's an option on youtube to slowdown the video...Use that

[@karoldunal8645]

I did IT i 127 moves WTF

[@lalelidiaries]

PUKU PUKU PAW PAW

[@the4throw28]

It's because the dude messed up a move right a the very end. You can see him place the small one on one he didn't have to

[@princesaisle7988]

Ur pattern is wrong... Do u really know how to do this?

[@UrGuru]

Its damn correct :)

[@haroldviernes5111]

I did it on 31 moves

[@adgamesadnan]

@@haroldviernes5111 no. of moves = (2^n )-1...=.127