@@Crandiddy4354 Man’s gotta make his bread. At this point, only 20 people support him on Patreon and he has tens of thousands of viewers who get such amazing content for free.
@@Crandiddy4354 That sounds like a lot tbh. A portion of my premium membership fee goes towards this channel, making it easier to support this channel and guarantee an ad-free experience. I'm sure he'll tone down the number of ads once he has a decent number of subscribers.
If anyone else had didn't immediately catch the logic behind the " other = 6 - (start + end) ", it's because if you tally up the values of rods 1,2, 3 that will equal six. Thus if start = rod 1 and end = rod3, 6-(rod1+rod3) = rod2, thus "other = rod2".
unless you are using indices to store values or calculating distance between indices or having some kind of significance with adding up the labels of the rods, im going to call that "logic" presented in the video magic numbered bullshit for the sake of pseudo-genius content.
Im really glad that UA-cam finally recommended something that I really needed. Your passion for CS I really resonate with. Amazing video and unparalleled explanation. After encountering recursion, my interest in dynamic programming dwindled quite a lot, but your videos really helped me overcome this hurdle of mine. Many thanks, keep up the amazing work, Here's to hoping for more amazing content Cheers!
Wow, that is one powerful comment Mohammad! Thanks for taking the time to write it and comments like yours mean a lot to me. I'm glad this video helped rekindle your interest in recursion and dynamic programming. Those are hard topics so there's no shame in admitting that they can be frustrating, and the goals of videos like this are to find a way past that frustration and focus on learning the beauty of the concepts, however hard that can be at times. I'm happy that you were able to see that through this video. I'm definitely planning on making future content, so stay tuned!
the effort you put into explaining these complex concepts is unimaginable. I have never seen this kind of presentation for explaining an algorithm. Keep it up please.
Thank you for taking the time and effort to make this video. The quality of the editing and animations in the video are excellent and remind me of 3Blue1Brown's videos. Great explanation and it really helped me to visualise and understand how this problem works!
A few years ago, I solved the towers of hanoi with a loop. I assumed, that there are always three rods. And I said, that an empty rod is a very large disc. I only needed one input: the number of discs. I had realized quite another pattern, for which it is important, whether the number of discs is odd or even. The pattern is, that every other move is the move of the smallest disc. If the number of discs is odd, it always moves start -> end -> other -> start. If the number of discs is even, it always moves start -> other -> end -> start. The other move is always the smaller of the two discs on top of the bigger disc. This solution might might have a few memory issues, but it works.
Solving it with a loop (and memory arrays) can even accommodate a larger N than the recursive-function approach can because you can bypass the stack-overflow ERR for large Ns. But you will get a D or F for your programming assignment in a CS class taught by a CMU/MIT/UC-Berkely-caliber prof, because you completely miss the point of the assignment, which is to test your grasp of *recursion*. You were being taught to conceptualize, to become a computer scientist/programmer/software engineer, not a day laborer hauling bricks with clever moves.
In the school I went to class assignments were graded by TAs only. I meant the TAs worth their salt would grade you D or F (for failing to write a recursive function) and the profs would back them up.
@@yaglehoole5662 You are missing a point, not me. I'm no American, I wasn't on a university and it wasn't a test of my grasp of recursion. Why are you concluding from the towers of Hanoi, that it has to be in a recursive function? Would I then say that, when I failed miserably for that (as you assumed)?
after watching the code part (from 16:00 to 20:00) a couple of times and not understanding a single thing, I wrote the functions on paper and watched again and my mind blew away. Damn you're amazing.
This video is soooo great! It took me awhile, but after repeating your video for 5 times, I finally understand this completely and was able to even work out examples with 5+ discs on my own. Thank you so much!!!
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
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.
Great video for introducing the puzzle! One piece of critique though, When you talked about the "recursive leap of faith" (the induction hypothesis) you took n-1 to mean the second to last domino. This can be a bit confusing. I think it's more explanatory if you just said: Pick any domino, and assume it will fall over. If it falls over, prove the next domino (+1) will ALSO fall over. Thus, the first domino falls because of the base case. The second domino falls down, because the first one falls. The third falls, because the second falls because the first, etc etc. That explanation is better at showing how a proof by Induction kind of "cascades" like dominoes, proving every case. Otherwise, it can seem a bit like assuming something random, just to come up with a result.
This is actually an amazing video, with super clear and simple explanations and animations. This is absolutely amazing and mind blows. Thank you so much
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.
As always, fantastic video, thanks a lot! I'm certain you know about this and just didn't mention it to keep things organized and a little more intuitive but I'd like to point it out anyways for the fellow viewers who might be interested: You can simplify the code even further when having n = 0 as your base case. It sounds kind of useless at first but solving the problem with 0 discs just means “do nothing“ which allows you to save space in your code: def h( n, start, end): if n = 0: do nothing else: other = 6 - (start + end) h(n - 1, start, other) pm(start, end) h(n - 1, other, end) ...this boils down to: def h( n, start, end): if n > 0: other = 6 - (start + end) h(n - 1, start, other) pm(start, end) h(n - 1, other, end)
Love this! I just recently discovered this channel through the FFT video (UA-cam recommendations) and I just immediately loved it! The topics covered are really cool, and I really like the way they're presented in here (Reminds me of 3b1b, not only because Manin is used here to do the bulk of the animations, but too because of the quality of the explanations). Now, one neat little fact about this algorithm for solving the towers of Hanoi is that if you have n disks, this algorithm takes exactly 2^n - 1 steps to complete (The proof is just a simple induction argument for those who might want to try to figure it out), and in fact, if I'm recalling this correctly, this is actually the optimal amount of steps, you can't go any lower than this! Quite fascinating if you ask me.
Thank you for this comment! I absolutely love compliments like this one! And yeah that's a fun inductive reasoning exercise -- fun fact by the way, you can see the number is steps is 2^n - 1 visually by generalizing the tree diagram for the recursion that we did here. In fact, I believe I touched upon this in the Big O notation video with the O(2^n) example. The basic idea is counting the number of nodes in a tree where at each level we have two branches representing calls to n - 1 and continue until we reach the base case of 1. The inductive argument you mentioned also works for solving this problem, but a fun visual addition. Thanks for sharing this!
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!!🎉
I had solved this problem on my own before watching the video. Btw, in my personal case I found the iterative solution harder to come up with than the recursive one. Since I had already solved this problem before watching the video, what blew mi mind was the little arithmetic "hack" to find the "other" rod: 6 - (start + end) LOL. Great stuff!
What is the reason for other = 6 - (start + end). There are 10 disks on the example? 14:02. If the first, second and third rod was labeled 1,2 and 3. Then the other rod is 6- (start+end). Is there a 4th rod? Edit: After som afterthought I think you possibly referring to the sum of tower numbers 1+2+3 = 6, but this wasn't explained deeply enough to be satisfying. So essentially this is a method of finding the auxiliary rod at any given time in the recursion.
We always have 3 rods: 1, 2 and 3. When start is 1, end is 2, then other is 6-(1+2) = 3. When start is 1, end is 3, then other is 6-(1+3) = 2. When start is 2, end is 3, then other is 6-(2+3) = 1, and so on. Thus, the formula makes sense.
@@quyenscc Thank you! Our teacher taught us by naming the rods 'from', 'to' and 'other' and passing them as string parameters 'A', 'B', 'C'. The lesson was on divide and conquer though, not recursion, maybe that's why.
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!
Thank you so much for these awesome videos. I'm currently taking course MITx 6.00.1x over on edX and your videos are really helping me understand the concepts. Thank you again.
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.
This video just explained it in easy manner.. Using animations make things to understand easily...Carry on and keep on adding the videos of data structures and algorithms in your playlist ..😀 Eagerly waiting for next video !!! Happy Learning !!
thank you so much you made it so easy and it seemed more logical, i spent one year thinking what possibly could that tiny code mean and now i get thanks to you!!!
woooooooooooooooooooooooooooooooooowww!! this was wonderful! the only explanation of this problem that made sense i tried searching all over and failed to get a good explanation of the problem and underlying concepts and this video covers all of it Grant Sanderson would be proud :)
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 now. i.e. n, source, temp, dest as n, A,B,C
I have never been good in math, even simple math. I have an app called IMPULSE. One of the games is Tower of Hanoi. It started out relatively simple but I was taking so long to finish each level and was ending up at 2% of the number of moves and time used. So i searched out a video to help me understand how this game works. I never thought it was a mathematical problem. One of my issues is my ADHD & ASD brain. Trying to keep organized in my thinking is not easy. But now I hope to finish my next level in much fewer moves. I will never reach a faster time, but improving in fewer moves is now my biggest goal. Thank you for this video
Here's a small typo (speako) you might want to address. Thanks for such clear visualizations, you've been a great help. 15:05 "solving hanoi for n-1 disks where the start ROD is the middle and the end ROD is the last ROD"
Back in 1994, this was on of the first assignments in my "Algorithms and Analysis" course, the one and only course every single programmer needs to take. Then you learn some sorting algorithms, and bam, you 're a programmer. All the rest is just building more algorithms. Even learning programming languages are completely secondary. Most of the class got it wrong, but most had think on it for a few hours. And this was at a community college, so recursive algorithms are not that hard. Over the years, I've been surprised how easy they've become. It's the iterative, efficient approach that's harder!
Thank you very much for this video. You have not only explained the problem easily but also introduced us to a framework to solve recursive problems. 👍
Beautiful. You’re really talented at unraveling seemingly complex concepts very elegantly. After watching your videos, I can’t help but knowing the concepts matter-of-factly. And wonder to myself why I wasn’t able to get it earlier.
damn, this channel is so underrated. I came here after watching your 5 steps for solving recursive problems and I am blown away after seeing that whole thing took only 10 lines of code, that's amazing
Excellent explanation. This recursive program definitely blew my mind when I first saw it two days ago. I hand-drew out the stack frames for a 3 disk problem. And even though it worked, I still couldn’t grasp HOW it was working-the abstract idea of n-1 recursively moving sequentially smaller stacks was the part the really got me. After watching this video a second time, it clicked. The crux of the program’s ability is in that assumption that n-1 will work. It’s pretty amazing stuff. Thank you!
The set of steps used for moving (n-1) tower of Hanoi from rod 1 to rod 2, if used in reverse order then the (n-1) tower of Hanoi returns to rod 1 from rod 2. In all cases all types of rings can be placed on the lowemost biggest ring as all other rings will be smaller than it and hence can be ignored while solving (n-1) tower of Hanoi. This thing was very beautiful 🤯🤯🤯
Black magic I tell you! That was crazy how a simple rule can solve a seemingly complex problem. I would have spent hours trying to intuit some complex solution to this.
Wow, that's just magic. Thank you for the detailed, visualised and simplified explication. Thanks to you another man on earth understood this problem and by extension a bit about recursion xD. And you obtain a subscriber of course
I got lost at pm(1,2). Don't know which line of code is doing that and from there don't also know how start and end keep changing from their given values e.g: start is 1 but then it becomes 3 later on and I don't get where the change in value is coming from. Any form of help is explaining is appreciated
If you keep making videos like this, you'll become the best and most famous CS teacher on UA-cam.
I agree. Never see someone like him. So passionate
The amount of ads on this video fucking disgusts me tho.
@@Crandiddy4354 Man’s gotta make his bread. At this point, only 20 people support him on Patreon and he has tens of thousands of viewers who get such amazing content for free.
@@lqv3223 He can't tone it down just
a little? I mean for God sakes man, fucking 6 ads on a 20 min video.
@@Crandiddy4354 That sounds like a lot tbh. A portion of my premium membership fee goes towards this channel, making it easier to support this channel and guarantee an ad-free experience. I'm sure he'll tone down the number of ads once he has a decent number of subscribers.
If anyone else had didn't immediately catch the logic behind the " other = 6 - (start + end) ", it's because if you tally up the values of rods 1,2, 3 that will equal six. Thus if start = rod 1 and end = rod3, 6-(rod1+rod3) = rod2, thus "other = rod2".
u made my day thank you:)
I was just about to say that "6" appears to be a *magic number* that should be defined based on core principles. Thank you for elucidating.
@@ryannickles3218 lol same
unless you are using indices to store values or calculating distance between indices or having some kind of significance with adding up the labels of the rods, im going to call that "logic" presented in the video magic numbered bullshit for the sake of pseudo-genius content.
so if I had 4 rods it will be (1+2+3+4) => 10-(strat+end)?
Now I realized that the steps for recursive problem solving is basically the same steps taken in induction proofs in mathematics.
That's why they're usually taught together in discrete math courses for computer science!
There is a generalized version of induction called "structural induction" which has uses in proving things about recursively defined objects
@@HuyTran-ny7mg yes I learnt that along with recursive functions in discrete math
I’m stunned 😮
Now I realized that I do not understand anything in either one or the other.😭
I can’t even belive that the video of this quality has so few views. Keep up the good work!
I am a simple person, I see recursion, I panic.
I am a professional math lover. I see recursion, I panic.
solid answer
solid answer
My jaw literally dropped when I saw that you had 32k subs, I was expecting over 500k!!! But now you're one sub closer!
Geez, SubCount Tripled in 1 month
Great explanation! Just a suggestion: highlight which line of the code is doing each step as you explain it
Im really glad that UA-cam finally recommended something that I really needed. Your passion for CS I really resonate with. Amazing video and unparalleled explanation. After encountering recursion, my interest in dynamic programming dwindled quite a lot, but your videos really helped me overcome this hurdle of mine. Many thanks, keep up the amazing work, Here's to hoping for more amazing content Cheers!
Wow, that is one powerful comment Mohammad! Thanks for taking the time to write it and comments like yours mean a lot to me. I'm glad this video helped rekindle your interest in recursion and dynamic programming. Those are hard topics so there's no shame in admitting that they can be frustrating, and the goals of videos like this are to find a way past that frustration and focus on learning the beauty of the concepts, however hard that can be at times. I'm happy that you were able to see that through this video. I'm definitely planning on making future content, so stay tuned!
the effort you put into explaining these complex concepts is unimaginable. I have never seen this kind of presentation for explaining an algorithm. Keep it up please.
Thank you for taking the time and effort to make this video. The quality of the editing and animations in the video are excellent and remind me of 3Blue1Brown's videos. Great explanation and it really helped me to visualise and understand how this problem works!
Thanks for the awesome comment! Glad this content helped you with this problem!
Lol, I was thinking of 3blue1brown too.
@@Reducible was that intro a reference to his ted talk hahaha
Nobody could have explained it better..genius.The dominos concept is gold!
A few years ago, I solved the towers of hanoi with a loop.
I assumed, that there are always three rods. And I said, that an empty rod is a very large disc.
I only needed one input: the number of discs. I had realized quite another pattern, for which it is important, whether the number of discs is odd or even.
The pattern is, that every other move is the move of the smallest disc. If the number of discs is odd, it always moves start -> end -> other -> start. If the number of discs is even, it always moves start -> other -> end -> start. The other move is always the smaller of the two discs on top of the bigger disc.
This solution might might have a few memory issues, but it works.
That is so interesting
that is how i solved it for my C lab problem. had to play it so many times to figure out that pattern
Solving it with a loop (and memory arrays) can even accommodate a larger N than the recursive-function approach can because you can bypass the stack-overflow ERR for large Ns. But you will get a D or F for your programming assignment in a CS class taught by a CMU/MIT/UC-Berkely-caliber prof, because you completely miss the point of the assignment, which is to test your grasp of *recursion*. You were being taught to conceptualize, to become a computer scientist/programmer/software engineer, not a day laborer hauling bricks with clever moves.
In the school I went to class assignments were graded by TAs only. I meant the TAs worth their salt would grade you D or F (for failing to write a recursive function) and the profs would back them up.
@@yaglehoole5662
You are missing a point, not me. I'm no American, I wasn't on a university and it wasn't a test of my grasp of recursion.
Why are you concluding from the towers of Hanoi, that it has to be in a recursive function? Would I then say that, when I failed miserably for that (as you assumed)?
after watching the code part (from 16:00 to 20:00) a couple of times and not understanding a single thing, I wrote the functions on paper and watched again and my mind blew away. Damn you're amazing.
I don't ever take the time to think of such hard problems. But your lessons gives me confidence. Thanks a lot!
I was thinking about this problem a while back, today I got one of your videos recommended to me, and now I'm here! Astounding explanation!
Best Teacher Award goes to u Man.....
Seriously best explanation I have ever seen 👌🔥🔥🔥🔥🔥
This video is soooo great! It took me awhile, but after repeating your video for 5 times, I finally understand this completely and was able to even work out examples with 5+ discs on my own. Thank you so much!!!
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
You are the 3blue1brown of computer science. Keep it up!
This is the visual version of CS Bible. A ton of respect and appreciation
I swear you are the best on the entire youtube platform
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.
The simplicity of the code is truly beautiful.
Great video for introducing the puzzle! One piece of critique though, When you talked about the "recursive leap of faith" (the induction hypothesis) you took n-1 to mean the second to last domino. This can be a bit confusing. I think it's more explanatory if you just said: Pick any domino, and assume it will fall over. If it falls over, prove the next domino (+1) will ALSO fall over. Thus, the first domino falls because of the base case. The second domino falls down, because the first one falls. The third falls, because the second falls because the first, etc etc. That explanation is better at showing how a proof by Induction kind of "cascades" like dominoes, proving every case. Otherwise, it can seem a bit like assuming something random, just to come up with a result.
Ah, that is a subtle and good point. Thanks for the feedback!
Yes that was a bit confusing
This is actually an amazing video, with super clear and simple explanations and animations. This is absolutely amazing and mind blows.
Thank you so much
Dawg respectfully, I audibly came when I watch this. 10/10 you're goated
This is the best explanation of tower of hanoi on UA-cam.
So thanks a lot.
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.
It was my biggest challenge when I started my CS course. It's a wonderful presentation, what a great work!
As always, fantastic video, thanks a lot!
I'm certain you know about this and just didn't mention it to keep things organized and a little more intuitive but I'd like to point it out anyways for the fellow viewers who might be interested:
You can simplify the code even further when having n = 0 as your base case. It sounds kind of useless at first but solving the problem with 0 discs just means “do nothing“ which allows you to save space in your code:
def h( n, start, end):
if n = 0:
do nothing
else:
other = 6 - (start + end)
h(n - 1, start, other)
pm(start, end)
h(n - 1, other, end)
...this boils down to:
def h( n, start, end):
if n > 0:
other = 6 - (start + end)
h(n - 1, start, other)
pm(start, end)
h(n - 1, other, end)
Love this! I just recently discovered this channel through the FFT video (UA-cam recommendations) and I just immediately loved it! The topics covered are really cool, and I really like the way they're presented in here (Reminds me of 3b1b, not only because Manin is used here to do the bulk of the animations, but too because of the quality of the explanations). Now, one neat little fact about this algorithm for solving the towers of Hanoi is that if you have n disks, this algorithm takes exactly 2^n - 1 steps to complete (The proof is just a simple induction argument for those who might want to try to figure it out), and in fact, if I'm recalling this correctly, this is actually the optimal amount of steps, you can't go any lower than this! Quite fascinating if you ask me.
Thank you for this comment! I absolutely love compliments like this one!
And yeah that's a fun inductive reasoning exercise -- fun fact by the way, you can see the number is steps is 2^n - 1 visually by generalizing the tree diagram for the recursion that we did here. In fact, I believe I touched upon this in the Big O notation video with the O(2^n) example. The basic idea is counting the number of nodes in a tree where at each level we have two branches representing calls to n - 1 and continue until we reach the base case of 1. The inductive argument you mentioned also works for solving this problem, but a fun visual addition.
Thanks for sharing this!
Very detailed and simple explanation. Keep up the good work
By Far the Best Explanation Ever for Recursion with Those Tips😀😀
Best explanation to leap of faith concept in recursion hands down (time trac: 11:00). Absolutely amazig. Subscribed
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!!🎉
Mindblowing explanation and animation! That 'Dominos' concept :), I personally liked it!
Thank you, I had a lot of fun making that domino animation so glad you appreciated it!
I had solved this problem on my own before watching the video. Btw, in my personal case I found the iterative solution harder to come up with than the recursive one. Since I had already solved this problem before watching the video, what blew mi mind was the little arithmetic "hack" to find the "other" rod: 6 - (start + end) LOL. Great stuff!
What is the reason for other = 6 - (start + end). There are 10 disks on the example? 14:02. If the first, second and third rod was labeled 1,2 and 3. Then the other rod is 6- (start+end). Is there a 4th rod? Edit: After som afterthought I think you possibly referring to the sum of tower numbers 1+2+3 = 6, but this wasn't explained deeply enough to be satisfying. So essentially this is a method of finding the auxiliary rod at any given time in the recursion.
Your comment helped here. Thanks mate 🤜🏼
We always have 3 rods: 1, 2 and 3. When start is 1, end is 2, then other is 6-(1+2) = 3. When start is 1, end is 3, then other is 6-(1+3) = 2. When start is 2, end is 3, then other is 6-(2+3) = 1, and so on. Thus, the formula makes sense.
It was quite clear I think
@@nikosrouskas2438 I think he though he had to add the number of disks in each rod
@@quyenscc Thank you! Our teacher taught us by naming the rods 'from', 'to' and 'other' and passing them as string parameters 'A', 'B', 'C'. The lesson was on divide and conquer though, not recursion, maybe that's why.
Best explanation of TOH I've ever heard.
You amaze with awesome content. The explanation was some understandable, I can hardly forget it. Thanks.
This is the video that explains the problem the best so far.
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!
Thank you so much for these awesome videos. I'm currently taking course MITx 6.00.1x over on edX and your videos are really helping me understand the concepts. Thank you again.
Best explanation to Hanoi tower and its basis in discrete mathematics and algorithms, This is multi target video!!
This was so awesome man, i watched all of your videos and they are amazing. Big fan here!!!!!
This is the best video visualization of any CS concept i have erver seen....... Keep it up
Holy crap, that 3 step list gave me an "aha!" moment. Great video!
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.
These videos remind me of 3blue1brown's videos. Really appreciating your work! Thank you!
3blue1brown to maths is Reducible to Algorithms
The best explanation with the best visual animation. An extraordinary work.
Thank you very much and please keep doing it.
Bless you, man. The best explanation on UA-cam.
world's best video to show how tower of hanoi works recursively
Best explanation ! I tried understanding this problem before but gave up, thankfully I found this video
5:30 was the moment of epiphany for me, thanks.
This video just explained it in easy manner..
Using animations make things to understand easily...Carry on and keep on adding the videos of data structures and algorithms in your playlist ..😀
Eagerly waiting for next video !!!
Happy Learning !!
thank you so much you made it so easy and it seemed more logical, i spent one year thinking what possibly could that tiny code mean and now i get thanks to you!!!
Honestly great job dude
You have much respect from me
I havent seen anyone having such a great ability making something so complex , look so easy
woooooooooooooooooooooooooooooooooowww!!
this was wonderful!
the only explanation of this problem that made sense
i tried searching all over and failed to get a good explanation of the problem and underlying concepts and this video covers all of it
Grant Sanderson would be proud :)
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 now.
i.e. n, source, temp, dest as n, A,B,C
God bless for such a beautiful explanation and Saving me from the sleepless night of not understanding the solution 🙏
I have never been good in math, even simple math. I have an app called IMPULSE. One of the games is Tower of Hanoi. It started out relatively simple but I was taking so long to finish each level and was ending up at 2% of the number of moves and time used.
So i searched out a video to help me understand how this game works.
I never thought it was a mathematical problem.
One of my issues is my ADHD & ASD brain.
Trying to keep organized in my thinking is not easy. But now I hope to finish my next level in much fewer moves. I will never reach a faster time, but improving in fewer moves is now my biggest goal.
Thank you for this video
Don't worry bro u can get more better ❤❤
best explanation available on internet
Thank you so much! The animations are amazing to aid our understanding of this problem. :)
Thank you for the kind comment and I'm glad the animations were able to help with your understanding!
oh my gawd after 30mins of trying to understand it from a book, i understood this algo in the first 5 mins watching your video!!!! THANKYOU
My mind is absolutely blown by this solution
You saved my day! I am taking a course on discrete mathematics and this was a heck of an explanation!!!! Cheers!
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.
This is the best explanation I have come across till date!! and nothing can be better than this.. thank you
if there is oscar for teaching it should go to this video,great explaination.
Here's a small typo (speako) you might want to address. Thanks for such clear visualizations, you've been a great help.
15:05 "solving hanoi for n-1 disks where the start ROD is the middle and the end ROD is the last ROD"
Best explanation I have seen on UA-cam, I appreciate your effort. Thanks for uploading this video :)
Back in 1994, this was on of the first assignments in my "Algorithms and Analysis" course, the one and only course every single programmer needs to take. Then you learn some sorting algorithms, and bam, you 're a programmer. All the rest is just building more algorithms. Even learning programming languages are completely secondary.
Most of the class got it wrong, but most had think on it for a few hours. And this was at a community college, so recursive algorithms are not that hard. Over the years, I've been surprised how easy they've become. It's the iterative, efficient approach that's harder!
Underrated channel.
the explanation is amazing! I hope you make more videos on more algorithmic problems. there are very few on youtube who explain with such clarity
Thank you very much for this video. You have not only explained the problem easily but also introduced us to a framework to solve recursive problems. 👍
Thanks for the kind comment! Glad to hear that this content helped you!
Beautiful. You’re really talented at unraveling seemingly complex concepts very elegantly. After watching your videos, I can’t help but knowing the concepts matter-of-factly. And wonder to myself why I wasn’t able to get it earlier.
damn, this channel is so underrated. I came here after watching your 5 steps for solving recursive problems and I am blown away after seeing that whole thing took only 10 lines of code, that's amazing
You need more views! Excellent explanation. Nothing can beat the Aha moment when you actually understand how something works! Thanks a ton
Subscribed. Who tf won't want more videos like this?!
best video ... literally background music .. soothes my mind
Woooow, this is mind blowing. I'll try to understand this again. Thanks for making it visual, I can undertake something
thank you so much man ❤️ please keep making videos like this 🙏the quality and simplicity you have is unmatched.
this video is an 11/10 effort
Great explanation and thanks to the ads I now have several passive income streams that will make me rich beyond my wildest dreams!
I finally understood this problem after I understood this problem
love it so much, you beat all those MIT lecturers
Holy f*** the domino visual made it all click for me!
Your work brought a lot of insights into solving recursive tasks, thanks!
Struggling CS student here. Really great video!
Excellent explanation. This recursive program definitely blew my mind when I first saw it two days ago. I hand-drew out the stack frames for a 3 disk problem. And even though it worked, I still couldn’t grasp HOW it was working-the abstract idea of n-1 recursively moving sequentially smaller stacks was the part the really got me. After watching this video a second time, it clicked. The crux of the program’s ability is in that assumption that n-1 will work. It’s pretty amazing stuff. Thank you!
Sir can u pls explain me this.. struggling since 4 days..
How can I contact u..
There was a smile on my face seeing the solution
🙂
thank you very much i never thought this problem will be so simple to understand. you made this hard problem very simple
The set of steps used for moving (n-1) tower of Hanoi from rod 1 to rod 2, if used in reverse order then the (n-1) tower of Hanoi returns to rod 1 from rod 2. In all cases all types of rings can be placed on the lowemost biggest ring as all other rings will be smaller than it and hence can be ignored while solving (n-1) tower of Hanoi. This thing was very beautiful 🤯🤯🤯
Black magic I tell you! That was crazy how a simple rule can solve a seemingly complex problem. I would have spent hours trying to intuit some complex solution to this.
Such a beautifully visualised video that I was able to code it within minutes of seeing it. Thank you so much
Great explanation, cleared the confusion to a great extent. Thanks
Wow, that's just magic.
Thank you for the detailed, visualised and simplified explication. Thanks to you another man on earth understood this problem and by extension a bit about recursion xD.
And you obtain a subscriber of course
What an insane work you did here. It's awesome. Thank you so much!
such a perfect explanation video about Hanoi Tower, thanks
I got lost at pm(1,2). Don't know which line of code is doing that and from there don't also know how start and end keep changing from their given values e.g: start is 1 but then it becomes 3 later on and I don't get where the change in value is coming from. Any form of help is explaining is appreciated