30-days Money-Back Guarantee
Minimax algorithm (and Alpha-beta pruning) in Python
Updated on Sep, 2026
Programming, Data Science, Python
Duration - 1.5 hours
Training 5 or more people ?
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
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, but 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.
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
Basic programming knowledge
Check out the detailed breakdown of what’s inside the course
Use your certificate to make a career change or to advance in your current career.
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Master prominent technologies at full length and become a valued certified professional.