1 option
AI Algorithms for Gaming/ with Eduardo Corpeǫ.
- Format:
- Video
- Author/Creator:
- Corpeǫ, Eduardo, speaker.
- Language:
- English
- Genre:
- Instructional films.
- Educational films.
- Video recordings.
- Physical Description:
- 1 online resource
- polychrome
- Place of Publication:
- Carpenteria, CA: linkedin.com, 2020.
- System Details:
- Latest version of the following browsers: Chrome, Safari, Firefox, or Internet Explorer. Adobe Flash Player Plugin. JavaScript and cookies must be enabled. A broadband Internet connection.
- Summary:
- Explore some of the most popular AI algorithms used to create two-player, turn-based games that are challenging enough to keep players guessing.
- In 1997, an IBM computer named Deep Blue beat Gerry Kasparov, a world chess champion, after a six-game match. While AI technology has grown in exciting, and often revolutionary, ways since Deep Blue's victory at the chessboard in the late 90s, many of the techniques it implemented are still relevant today. In this course, explore some of these techniques as you learn how to leverage key AI algorithms to create two-player, turn-based games that are challenging enough to keep players guessing. Instructor Eduardo Corpeǫ covers using the minimax algorithm for decision-making, the iterative deepening algorithm for making the best possible decision by a deadline, and alpha-beta pruning to improve the running time, among other clever approaches. Plus, he gives you a chance to try out these techniques yourself as he steps through the development of a cat trap game using Python.
- Participant:
- Presenter: Eduardo Corpeǫ
- Notes:
- 4/10/20201
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.