Tower of Hanoi: Six Rings Solution 6.
Vložit
- čas přidán 29. 11. 2017
- 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
Thank you for this visualization, it helped a lot to understand what I was reading while studying Discrete Mathematics textbook
Thank you so much. I understand it now😄
i had to do this for my math project know i think im gonna pass
and i also downloaded the app
thanka
You are welcome...May I know you are from which country...?
I now understand how to finish it. Thanks
Thank you for this video i was struggling in level 190
same untitled door game
@@Stopchangingmynamejesuschrist Me Too, I Was Doing it, but the ping spiked.
This is helpful.. Thanks
Thank you! I need to finish this for coding class and this helped a bunch! 🤩
thank you very very much!!!
Oh wow!! I’d get stuck after move 15! Thanks
Thanks I need it for my Informatic project with scratch
Glad I could help
Just move your even ring position to odd or odd to even with out repeatation
My fastest time on completing the 5 pice is 27.8 seconds. Im working on the 6 peice to get faster 𝚞𝚙𝚍𝚊𝚝𝚎:𝚒 𝚋𝚎𝚊𝚝 𝚝𝚑𝚎 𝚠𝚘𝚛𝚕𝚍 𝚛𝚎𝚌𝚘𝚛𝚍 𝚏𝚘𝚛 𝚝𝚑𝚎 𝚜𝚒𝚡 𝚙𝚎𝚒𝚌𝚎. 𝚖𝚢 𝚛𝚎𝚌𝚘𝚛𝚍 𝚒𝚜 31.00𝚜𝚎𝚌 𝚊𝚗𝚍 𝚝𝚑𝚎 𝚠𝚘𝚛𝚕𝚍 𝚛𝚎𝚌𝚘𝚛𝚍 𝚒𝚜 35.59 𝚒 𝚝𝚑𝚒𝚗𝚔
🫡
Propongo una soluzione semplice semplice e soprattutto mnemonica. La regola
è la seguente:
- in una mossa muovi il disco più piccolo, in modo circolare (paletti: a -> b -> c -> b, -> a, ecc.),
- in quella successiva ti trovi a dover effettuare l'unica operazione possibile,
- nella mossa successiva muovi di nuovo il disco più piccolo in modo circolare,
- nella mossa dopo ti ritrovi a dover effettuare l'unica operazione possibile
e così via, fino ad aver portato tutti i dischetti dal paletto "a" al paletto di destinazione finale "c".
La presente regola corregge anche la prima mossa per i dischi dispari,
in quanto si ripete la prima mossa del disco più piccolo da a -> b e da b -> c.
Spero di essere stato chiaro, grazie e buon divertimento.
Perché se sono dispari il 1 passaggio è A-C e sono pari è A-C???
Plzz ... Do this.. 35 moves in 6 disk please
Noice 😎
all I can say: OMG
I have understood the principle behind it , good solution anyways
Good
@@UrGuru I had a doubt in TAT does the story always have to be simple things around our life, our should we refer your 50 TAT themes?? And how did u gram TAT in your SSB??
Hello.can i share your post? Please, would you come back?
Yes
Even by 2017 standards this song was overused. Good video tho
+Aiden Ocelot Thanks bro
I know how to work it out
Can someone copy and paste the whole thing
Build 3 in middle
Build 4 in last
Build 5 in middle
Move last to last
Build 4 to first
I solved it in 345 movies 😂😂
Like if beacuse antistres
ang galing niya
Siapa yg kesini grgr tugas?
This is wrong you jumped the middle pole with the smaller disk on it with the larger disk larger disk
pano ba huhuhuhu
i can see a tank in 1:20
Who cares I have a technique
who cares about your technique tho?
Jealous
@@nigel2065 oh hello brother