Artificial intelligence: Minimax algorithm
Implementation of the Minimax algorithm (and Alpha-beta pruning) in Python
Description
In this artificial intelligence course, we will implement the Minimax algorithm and its optimized version, the Alpha Beta pruning algorithm.
We will apply the algorithm to the tic-tac-toe game, creating an artificial intelligence which cannot be beaten. The algorithm will be implemented in a generic way, so that it can be easily applied to other games.
This course is aimed at developers who would like to add artificial intelligence into their games, those who would like to implement the Minimax algorithm, as well as students and artificial intelligence enthusiasts. This course also aims to be a stepping stone to more advanced courses in artificial intelligence, machine learning and deep learning.
This course, taught using the Python programming language, requires basic programming skills. If you don't have the required foundation, I recommend getting up to speed by taking a crash course in programming (if you wouldd like, I offer a crash course in Python programming on Udemy).
Concepts covered:
The Minimax algorithm and its implementation in Python
The Alpha-beta pruning algorithm and its implementation in Python
Artificial intelligence in video games
The creation of artificial intelligence modules and frameworks
The concept of heuristic functions
Do not wait any longer before jumping into the world of artificial intelligence!
What You Will Learn!
- The minimax algorithm
- The implementation of the Minimax algorithm in Python
- The Alpha-Beta pruning algorithm
- The implementation of the Alpha-Beta pruning algorithm in Python
- Artificial intelligence in video games
- Improving your Python knowledge through practice
Who Should Attend!
- For those who want to learn the Minimax algorithm
- For developers who want to introduce artificial intelligence into their games
- For those who are interested in artificial intelligence