Towers of Hanoi: A Complete Recursive Visualization

Video quality	The size	Download

Информация о Towers of Hanoi: A Complete Recursive Visualization

Название	:	Towers of Hanoi: A Complete Recursive Visualization
Продолжительность	:	21.13
Дата публикации	:
Просмотров	:	352 rb

VISUALIZATION WISE, This shit is easy, implementing this shit into code, it's a whole fucking different story
Comment from : Ichirou Takashima

Your work brought a lot of insights into solving recursive tasks, thanks!
Comment from : Mariia Tverdokhlib

The concept came from tower of bramha in hindu temple in india and it has 64 golden discs😭 imagine solving that one
Comment from : Anand Suralkar

finallyyyyyyy
Comment from : Saad Rao

This is the best video visualization of any CS concept i have erver seen Keep it up
Comment from : kedar deshmukh

Thank you so much
Comment from : dtgiabao99

spent 2 hours last year trying to understand towers of hanoi without any context (just by lloking at code) finally gave up and now, after you explained the recursive approach I coded it in python in 10 minutes just shows what a huge difference a systematic approach can make your video helped me immensely thank you
Comment from : Abhirup Bhattacharyya

I can only explain this as black magic
Comment from : SalmanU

Beautiful
Comment from : Karnophile duh

If your brain is blown away, how are you still alive !?
Comment from : ALOK THOTTAKATHU PRASANNAKUMAR

Great explanation, cleared the confusion to a great extent Thanks
Comment from : Kavita Sharma

thanks for this!
Comment from : PankyFPS

Still don't understand why this works? What is basis for the assumption that solving for N-1 will solve for N?
Comment from : D K

Using this logic to make an entity pathing algorithm
Comment from : LionDove Learning

7 moves was the minimum I could do it
Comment from : Ncedo Languza

Hanoi is not hard, dafuq are you on about 😃😃
Comment from : SwordQuake

amazing
Comment from : Time Craft

More like induction
Comment from : Luckmore Ndlovu

,l👍
Comment from : Aditya Yadav

Thank you so much I was using n,A,B,C initially which was bit difficult but after watching your video it make more sense nowbrie n, source, temp, dest as n, A,B,C
Comment from : algorithms

Greatest video ever on towers of hanoi problem Even though I have tried to understand this problem number of time I finally understood it here Because I was trying to name the discs as well but now I realised it isn't necessary since we'll always be moving top disc on a certain rod Absolutely amazing way of explaining!! Keep it up!!🎉
Comment from : Sam Godse

What an insane work you did here It's awesome Thank you so much!
Comment from : Dan

5:30 was the moment of epiphany for me, thanks
Comment from : Qyuu

Madam Faruzan brings me here
Comment from : Pham Cy

Thank you so much for this No one has explained recursion as well as you did I had a similar problem to this in one of my assignments: Find recursive function to solve a tower of hanoi for n discs if you want to move them from 1st peg to 3rd peg and you can only move discs to an adjacent peg I was overwhelmed when I tried it on my own the first time but after watching your video I was able to figure out the solution for this modified version of the problem Keep up the great work
Comment from : David Ruiz

Vrains?
Comment from : Hyoroemon gaming

Thank you so much This is by far the best explanation on youtube for this problem Thoroughly understood the logic because of the amazing animation
Comment from : Surabhi Gupta

It's not that hard
Comment from : Priyanshu SR

This was a GREAT explanation Thank you so much!
Comment from : SGanguly

what is the name of the track in 19:01 it takes away my soul damn good !
Comment from : The Anandharajan

Honestly great job dude brYou have much respect from mebrI havent seen anyone having such a great ability making something so complex , look so easy
Comment from : Κωνσταντινος Χατζηιωακειμ

Awesome ! Great Explanation
Comment from : Siva G

This is the video that explains the problem the best so far
Comment from : 눈에눈이들어가니눈물인가눈물인가

the recursive leap of faith it's just mathematic induction
Comment from : Geovanny Camargo

If you wanna make the problem harder, impose another rule: you are only allowed to move the disk to a rod that is immediately adjacent, like moving a king one space at a time in chess
Comment from : Micah Mock

Simply no words to praise this person! I often feel lazy for leaving comments on youtube videos, but this time I must Kindly make a playlist for explaining the theory of all the data structures and algorithms
Comment from : MUHAMMADASAD SHAHAB

Woooow, this is mind blowing I'll try to understand this again Thanks for making it visual, I can undertake something
Comment from : Alex Matthew

Best explanation ! I tried understanding this problem before but gave up, thankfully I found this video
Comment from : Ayan

I don't know why this is such an easy puzzle for me but it's hard to put into words It's just the same pattern again and again
Comment from : Weight Elk

12:24brThis example is so good, The ONLY way to make it better is to have setting up the dominoes from right to left represent something, Change my mind
Comment from : AJOutlaster

best explanation available on internet
Comment from : Rashid Yaseen

This was super effective and the example at 16:12 made it that much more understandable If there's anything I could add, it would be that something like a pointer that was cycling through the line of code that was taking place for the recursive function would have tied everything together Great job nevertheless
Comment from : Jo A

woooooooooooooooooooooooooooooooooowww!!brthis was wonderful!brthe only explanation of this problem that made sensebri tried searching all over and failed to get a good explanation of the problem and underlying concepts and this video covers all of itbrGrant Sanderson would be proud :)
Comment from : Rajat Rathi

This, indeed, blew my mind! Thank you so much! This was very interesting and educational to me!
Comment from : Tasty Pie

it's a awesome video, explain this complicated problem easily and help to solve other problems
Comment from : NYBlueBlueSky

Such a beautifully visualised video that I was able to code it within minutes of seeing it Thank you so much
Comment from : Vinwizard

can u make me your student cause i really loved the explanation that u just gave
Comment from : ellis

i thought you can only move one disk at a time?
Comment from : Theo Vasilopoulos

Beautiful!
Comment from : Stardust

Amazing
Comment from : Andrew Kipsang

Ok, so how to input this in java? Pls help huhu
Comment from : Green Black

If it doesn't blow your mind do you even have soul 🤣 well done यार मज़ा आ गया brThank you so much for this explanation
Comment from : Harsh Kumar

I feel so stupid
Comment from : MonkMode

12:30
Comment from : Muskan Purohit

Thanks a lot for the great explanation !
Comment from : Raghavendra K

Demnnn , appreciate it!!, Get to see all the visualisation of disks nd rods, that how the recursion actually works here
Comment from : Rishabh Ale

The non recursive solution is much easier
Comment from : ben mansour mahdi

best video literally background music soothes my mind
Comment from : Ratik Goyal

Mind-blowing
Comment from : VR _

The concept of recursive function is powerful and is a good step in problem solving However, practically, recursion is a waste of memory and cpu because of these multiple nested function calls The step forward is to replace recursion by a loop with a termination condition and a stack in order to store and process parameters like n, start, endbrIndeed, compilers treat recursive function calls by managing a stack
Comment from : Wolf 424

I'm too stupid for this ☹️
Comment from : Riyan

if there is oscar for teaching it should go to this video,great explaination
Comment from : SCOUT OP

wooah!
Comment from : autobot realm

I got it now, thanks to your animation
Comment from : Shirish Bhadekar

Best explanation to leap of faith concept in recursion hands down (time trac: 11:00) Absolutely amazig Subscribed
Comment from : Sheraz Khan

Gives me 3b1b vibes and I like it
Comment from : William Wang

Best!
Comment from : Arindam

Excellent explanation 🔥🔥🔥
Comment from : Lovish arora

by the way i loved the background music It really helps me focus on the concept
Comment from : BubbleSort

the best videos that i have ever watched that explains Towers of Hanoi I love this channel Keep up the good work I can't wait watching this kind of vids
Comment from : BubbleSort

This one is Hanoi-ingly simple when you know how
Comment from : Loz D

Nobody could have explained it bettergeniusThe dominos concept is gold!
Comment from : SOURAV SHARMA

14:35 "We can assume this call works, so we can use it as a part of our solution": At this moment something clicked in my head, I quit the video and few moments later I had a program that solves the problem
Comment from : Juhana Kaarlehto

2:03 "And honestly" sounds like 3B1B lol
Comment from : Jar Juice Machine

Should do it with multiple rods/pegs
Comment from : Kenneth Dang

Hey i really like ur content !! Do you brecommend/b any other channels that discuss god level topics like u xd (channel that helped you in learning CS ) b?/b Thanks in advance :D
Comment from : Mohamed Aziz Ennour

a great man
Comment from : mohista sal

what is pm(start, end)? what does it do?
Comment from : Martin Martinčić

HaNoi is the capital of VietNam
Comment from : Cường Huỳnh

Loved it Thanks
Comment from : Hey_Adi

Amazing!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! I have been trying to solve this problem for a while now and I was so confused with other solutions on the internet (the code of the solutions) but yours is extremely intuitive and elegant I am very new to recursion and you made this so understandable THANKS! I hope you continue making such videos because you really really help the community!
Comment from : Nikos Rouskas

Is this hard for people? I figured it out immediately, just checked the video to prove I solved it in my head correctly and the comments are depressing to my outlook on general peoples intelligence Guess I have no soul
Comment from : Sebastien Pelletier