Harvard CS50’s Artificial Intelligence with Python – Full University Course

2,201,419
0
Published 2023-08-10
This course from Harvard University explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like large language models, game-playing engines, handwriting recognition, and machine translation. Through hands-on projects, students gain exposure to the theory behind graph search algorithms, classification, optimization, reinforcement learning, and other topics in artificial intelligence and machine learning as they incorporate them into their own Python programs.

This course has been updated for 2023 to include an in-depth section on large language models.

✏️ Course developed by Brian Yu for Harvard University. Learn more about Brian: brianyu.me/

🔗 Course resources: cs50.harvard.edu/ai/2020/

⭐️ Course Contents ⭐️
⌨️ (00:00:00) Introuction
⌨️ (00:02:26) Search
⌨️ (01:51:55) Knowledge
⌨️ (03:39:39) Uncertainty
⌨️ (05:34:08) Optimization
⌨️ (07:18:52) Learning
⌨️ (09:04:41) Neural Networks
⌨️ (10:46:00) Language

🎉 Thanks to our Champion and Sponsor supporters:
👾 davthecoder
👾 jedi-or-sith
👾 南宮千影
👾 Agustín Kussrow
👾 Nattira Maneerat
👾 Heather Wcislo
👾 Serhiy Kalinets
👾 Justin Hual
👾 Otis Morgan

--

Learn to code for free and get a developer job: www.freecodecamp.org/

Read hundreds of articles on programming: freecodecamp.org/news

All Comments (21)
  • @edwardb7811
    Professor Yu is in his mid-twenties and teaches one of the most subscribed courses at Harvard. Amazing!
  • @0rjuela
    Listing some subchapters for future reference 01:07:41 - A* Algorithm - "heuristc search" for a singleagent 01:14:27 Adversarial Search (Tic-Tac-Toe) 01:39:07 Optimization - Alpha-Beta Prunning 01:46:53 Chess -Depth Limited Minimax 02:14:05 Inference Algoritms -Model Checking 02:32:42 Knowledge Ingeneering - Clue 02:43:04 Logic Puzzles - Harry Potter 02:56:16 Inference Rules 03:22:26 Inference by Resolution 03:39:39 Uncertainty - Probability theory 03:49:16 Conditional Probability 04:05:58 Bayes Rule 04:13:40 Joint Probability
  • @hamidhussain5488
    Grateful to the Harvard University for providing this course. Thank you brian yu and all of them who are behind to provide this course.
  • @Daniel-Six
    Brian is incredibly organized and polished. If I had professors this good back when I was in school for CS it would have been a vastly more productive experience.
  • @ShadowMind312
    When i did my Masters in mathematics, only one of the professors at my school had solid understanding of these topics. I learned as much as i could, but he was overwhelmed with students. I am grateful for these videos!
  • @hollowskull4666
    What I love about these Harvard CS50 videos is the speed they talk and explain things. It's captivating.
  • @a3gzuy
    This is amazing! Both the course and the teacher. Thank you very much for sharing this.
  • @MrSoikafy
    It's the best thing I have ever seen on YouTube. Great job, thank you for every minute of this course.
  • @user-qf6rv1ch6d
    Thanks for putting together this course in one video.. Thank you so much for all of the free courses you upload.
  • @reelYtube
    Thank you so much! The only platform who made me take interest in programming after spending 3 years in my 4 year Bachelors degree of CS. CAN'T THANK YOU ENOUGH!🙏🏼
  • @imad1996
    There are many unique aspects of those videos, but what is really nice is the depth of explaining such concepts. Even in a university, they usually cannot go that deep mostly due to time constraints.
  • @hunterwu94
    - [00:00](youtu.be/5NgNicANyqM?t=0s) 🤖 The course explores foundational concepts and algorithms of modern artificial intelligence, covering topics like graph search algorithms, optimization, reinforcement learning, and more. - [03:16](youtu.be/5NgNicANyqM?t=196s) 🛣️ AI aims to solve problems by searching for solutions using various actions and transitions between states in a state space. - [07:00](youtu.be/5NgNicANyqM?t=420s) 🧩 States represent configurations, actions are choices, and transition models define the outcome of actions. Goal tests determine if a state is the goal, while path costs measure the cost of actions. - [11:31](youtu.be/5NgNicANyqM?t=691s) 🔄 A search problem involves exploring states using a frontier, a data structure containing states to be explored next. A loop-based search algorithm iteratively explores the frontier, considering possible solutions. - [19:35](youtu.be/5NgNicANyqM?t=1175s) 🕵‍♂ The search algorithm involves removing nodes from the frontier, analyzing their state, parent, action, and path cost to navigate the search space and find solutions. - [33:09](youtu.be/5NgNicANyqM?t=1989) 🔄 Depth First Search (DFS): Explores one path until a dead end is reached, then backtracks and tries another path. Can lead to non-optimal solutions. - [36:24](youtu.be/5NgNicANyqM?t=2184) 🌐 Breadth First Search (BFS): Explores all possible paths at a given depth level before going deeper. Guarantees optimal solutions but may require more memory. - [38:51](youtu.be/5NgNicANyqM?t=2331) 💻 Code Implementation: The video demonstrates code implementation of DFS and BFS for solving mazes, highlighting their exploration strategies and memor
  • @illesbalog
    Thank you so much for all of the free courses you upload
  • @gurerguncan
    I can’t afford to miss this. This weekend I’ll go in depth this course. A value bomb! Thank you profesors!
  • @johnmo1111
    Thank you so much. I don't recall ever enjoying a lecture series as much as this. Great work! I hope to see a follow up in a few years.
  • @fakito2082
    I love the way he explains everything. Thanks for the course
  • Almost two hours in and it's so good; I understand the concepts really well. Thank you, Mr. Brian. I am really enjoying the course!