Best explanation video for Towers of Hanoi problem! I’ve watched 5 other videos (and mind you, 3 of them are around 20 minutes long each) and rewatched them multiple times but the answer just wouldn’t click for me but I watched this one video and understood the solution right away. Thank you so much!
I cant thank you enough, have to submit the assignment tomorrow with the restricted tower of hanoi problem, knew the equation 3(number of previous moves)+2, but didnt know how it worked. Thanks so much
This is an excellent explanation and has helped me a lot. I suggest Just one minor adjustment. at 8:46 I suggest you explain that T(k+1) = 2 x T(k)+1 because the recursive formula states T(n) = 2 x T(n - 1) +1. Therefore T(k+1) = 2 x T(k+1-1)+1 = 2 x T(k) +1. I was stumped for a while before I worked that out
I just made some Tower of Hanoi animations for my channel, went to see what other videos are out there on the topic, found your channel and ... wow, you've made so many math videos:) that only received few views:( You usually cover more advanced stuff than most math UA-camrs, but it still seems like it would be better to select some interesting/intriguing bigger topic (e.g. Godel incompleteness theorem, Basics of math logic) and introduce/explain concepts (proof by contradiction, proof by induction) that come along the way (kind of like Mathologer/3Blue1Brown style), instead of covering various questions in isolation.
Thank you! And congratulations for creating such wonderful animations! And you are absolutely right. Broader topics would be more interesting. I've actually created this content to prepare for my own exams.
@@sallaklamhayyen9876 Honestly, I'm not sure, because I'm a beginner myself. I've just created those videos as a preparation for my exam. Doing a lot of different exercises will definitely help.
I don't know if I can ask you this question, but after you move the N-1 disk to the second row Number of times all disks have been moved to the third column Why is it the least? I can understand if I study while drawing the Hanoi Tower But I can't explain it in words How can I prove it?
I don't understand the step with T(3), because if I use the explicit formula I've 2^n - 1 and that's 2^3 - 1 = 8 but if I use your recursive formula I've 2T(n - 1) + 1 I get 2 * 3 + 1= 7 so that's not equal so how is that working? or am I just missing smth?
i was ready to give up until i saw this. thank you so much you explained this 100% perfectly
haha, i am so glad i was able to help! :)
@@flolu You made me little bit smarter
yes fr it was a horrible journey
Best explanation video for Towers of Hanoi problem!
I’ve watched 5 other videos (and mind you, 3 of them are around 20 minutes long each) and rewatched them multiple times but the answer just wouldn’t click for me but I watched this one video and understood the solution right away. Thank you so much!
I’ve understood so much better Thankyou
Excellent explanation :-) The best of the 5 explanations I have watched this afternoon.
I cant thank you enough, have to submit the assignment tomorrow with the restricted tower of hanoi problem, knew the equation 3(number of previous moves)+2, but didnt know how it worked. Thanks so much
Ich deklariere hierbei dass du mich gerettet hast und mir die Motivation Mathe zu lernen wiedererstatten konntest danke bruder
Dude this is one of the best ones out there. Why is it so hard to find?
You are my savior. Thank you
best explanation i've seen! very good video thank you.
thank you sir! without fancy graphics its completely understood.
This is an excellent explanation and has helped me a lot. I suggest Just one minor adjustment. at 8:46 I suggest you explain that T(k+1) = 2 x T(k)+1 because the recursive formula states T(n) = 2 x T(n - 1) +1. Therefore T(k+1) = 2 x T(k+1-1)+1 = 2 x T(k) +1.
I was stumped for a while before I worked that out
no
very intuitive explanation of the solution. thank you!
Thanks for the video you explained it better than anyone else ive seen!
I really appreciate those words, thanks!
Best explanation so far
Glad you think so!
Thanks bro You save my life
Great explanation. Thank you
Excellent explanation!!
the best video on this topic cause I've watched several and couldn't understand until now
Thank u so much , it helps me lot .
Love from India❤️
I just made some Tower of Hanoi animations for my channel, went to see what other videos are out there on the topic, found your channel and ... wow, you've made so many math videos:) that only received few views:(
You usually cover more advanced stuff than most math UA-camrs, but it still seems like it would be better to select some interesting/intriguing bigger topic (e.g. Godel incompleteness theorem, Basics of math logic) and introduce/explain concepts (proof by contradiction, proof by induction) that come along the way (kind of like Mathologer/3Blue1Brown style), instead of covering various questions in isolation.
Thank you! And congratulations for creating such wonderful animations!
And you are absolutely right. Broader topics would be more interesting. I've actually created this content to prepare for my own exams.
@@flolu
Thanks you too:)
> I've actually created this content to prepare for my own exams.
That's a nice strategy!
Hope your channel grows!
brilliant explaination !!
Thank you
you are the best
Perfect video
Thank you so much. It helped me a lot :)
Superb explanation thank you so much. Please continue
Glad I could help!
@@flolu what best course or book or any resource or strategy to learn discrete math for a beginner?
@@sallaklamhayyen9876 Honestly, I'm not sure, because I'm a beginner myself. I've just created those videos as a preparation for my exam. Doing a lot of different exercises will definitely help.
@@flolu Ok thank you again
That was a great explanation thank you so much ❤
Glad it was helpful!
bester Mann, rekursive Programmieraufgabe erledigt
👌
Das freut mich 💪😅
Awesome! Thanks a lot.
I appreciate, that I was able to help :)
excellent thank you
I don't know if I can ask you this question, but after you move the N-1 disk to the second row
Number of times all disks have been moved to the third column
Why is it the least?
I can understand if I study while drawing the Hanoi Tower
But I can't explain it in words
How can I prove it?
Amazing... Thank you
I'm glad I could help you :)
Sorry that you are underrated 🥺
Keep up
Btw you have different style of writing one😁
Thank you, I appreciate your comment!
really good :) thanks
Could proof by Induction be completed with 4 poles instead of 3 for The Tower of Hanoi?
That's definetly possible
I don't understand the step with T(3), because if I use the explicit formula I've 2^n - 1 and that's 2^3 - 1 = 8 but if I use your recursive formula I've 2T(n - 1) + 1 I get 2 * 3 + 1= 7 so that's not equal so how is that working? or am I just missing smth?
You miscalculated. 2^3 - 1 = 2 * 2 * 2 - 1 = 7.
Thank you bro♥️♥️♥️
Glad that I've could help :)
tysm
❤
@Florian Ludewig und ich wollte eigentlich einen Algorithmus finden, mit dem ich das spiel spielen kann.
Quasi als anleitung, Damit ich in der minimalen anzahl von zügen jeden Schwierigkeitsgrad schaffe.
In dem Algorithmus fehlt nur die info, wann ich welche scheibe auf welchen turm ablege
@@universeexpansioninkoran1466 Das schaffst du schon. Viel Glück
R u german?
Yes I am