AI Algorithms for Gaming
AI Algorithms for Gaming
.MP4, AVC, 1280x720, 30 fps | English, AAC, 2 Ch | 2h 5m | 282 MB
Instructor: Eduardo Corpeño
.MP4, AVC, 1280x720, 30 fps | English, AAC, 2 Ch | 2h 5m | 282 MB
Instructor: Eduardo Corpeño
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ño 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.
AI Algorithms for Gaming
