Artificial intelligence: Minimax algorithm

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!

Rating Distribution

• 1 stars: 2 votes
• 2 stars: 0 votes
• 3 stars: 1 votes
• 4 stars: 1 votes
• 5 stars: 6 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!