I am not a B. Gates fan, but he has said two very intelligent things that have stuck with me. He stated, if you want to be successful, copy someone that is very successful and change it 10%. David is definitely a awesome model for teaching and presenting. Brian is defenently on the right path of success! Love both Brian's and David's classes!
I've just finished CS50 AI yesterday and i can tell you it is great! I can highly recommend this course to everyone who finished CS50x and who is interested in actually implementing all the things Brian is explaining in this video.
I am taking CS104 at USC an we just talked about Dijkstra and A* algorithmn. Our professor explained them on graphs because that's what these algorithms are used on. But it is hard to get an intuitive sense on the pros and cons of the algorithmn when the examples are abstract. I started to binge watch CS50 last weekend because I missed the feeling of being excited and enjoy a CScourse. I'm so happy to be led to this video! I always hope that my later CS classes at colleges can be taught in the same way as CS50 is, and I feel so fortunate that I found a video that talks about the same materials. I hope there be higher level courses in CS50 series so we can continue the study after introductory level.
@@gnarly4587 a friend of mine is showing me how to html websites I hope to do that full time I am waiting for my wife to graduate with her PhD then I can kick off a different career
What a great lecture and introduction to AI, helps to demystify it. I cant help but wonder how to use AI to enhance the access to accurate information.
As always great lecture from CS50. I've enjoyed the whole hour. Special thanks to Mr. Brian and Mr. David, and thanks a lot who are working behind the scene.
Fascinating. So the computer seems capable of randomly programing itself outside of what the programmer originally designed. And no one know how it is doing it. That's very scary !!!
Where is the series of these videos? This seems to be a most up to date video as it was released in December 2020, all of Edx's videos were recorded in April 2020. In other words where is the next video that goes along to this video.
You are aweeeeeeeeeessssssssoooooom💗💗💗💗💗💗💗💗💗💗💗💗💗💗💗💗💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝🎉🎉🎉🎉👌. This is the place that I looked for.very great understanding of algorithms. Fortunately I come from robotic environment. Awesome.
I don't get the obstacle explanation. Wouldn't it be better for you save the obstacle coordinates and just not go to those coordinates instead of letting the algorithm choose the same obstacle from a different direction? What practical benefits does it achieve when you let the ai fail for the same obstacle but in a different way? Is there a concrete practical application of letting the ai fail in minute ways for the same obstacle?
As we know shortest distance from A to B is straight line, so why don't we find path which follows near to the straight line from A to B like Darboux sums ?
It would be great for us CS novices to have a detailed walkthrough for the examples shown in the lecture (maze.py for Lecture 0) and for the Projects/Homework, just like Doug Floyd did for CS50.
