Artificial Intelligence: Minimax Algorithm
Minimax algorithm (and Alpha-beta pruning) in Python
Updated on Jun, 2025
Language - English
Development ,Data Science,Python
Lectures -12
Duration -1.5 hours
Lifetime Access
Lifetime Access
30-days Money-Back Guarantee
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
Course 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, 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.
Goals
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
Prerequisites
Basic programming knowledge
Curriculum
Check out the detailed breakdown of what’s inside the course
Introduction
1 Lectures
-
Introduction
02:40
02:40
Minimax Algorithm
3 Lectures
Implementation
6 Lectures
Alpha-beta pruning & conclusion
2 Lectures
Instructor Details
Maxime Vandegar
Course Certificate
Use your certificate to make a career change or to advance in your current career.
Our students work
with the Best
Related Video Courses
View MoreAnnual Membership
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Subscribe now
Online Certifications
Master prominent technologies at full length and become a valued certified professional.
Explore Now