Skill Level Advanced
- Playing against the computer is only fun when it's challenging, let alone beating a human player at chess. I'm Eduardo Copeno and I'm excited to tell you all about some of the most popular algorithms behind game playing computers. One of the many exciting areas of artificial intelligence. In this course we'll go over some of the techniques implemented by Deep Blue, the IBM computer that defeated the chess world champion, Garry Kasparov back in 1997. You'll also get to see these techniques in a fun implementation of the Cat Drop game, developed in Python. Plus you'll have the chance to play around with the code. So welcome to the course. I'm sure you'll find these clever tricks interesting.
What you should know1m 6s
1. Turn-Based Games
2. The Minimax Algorithm
3. Depth-Limited Search
4. Iterative Deepening
5. Fun with Optimizations
Next steps2m 14s
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.