Artificial Intelligence Decision Making: Minimax
In this course, you'll learn how to create a game playing AI that can play Tic Tac Toe and Connect Four.
Start
Key Concepts
Review core concepts you need to learn to master this subject
Minimax algorithm state value
Minimax algorithm problem specification
Minimax algorithm assumption
Minimax algorithm game representation
Minimax algorithm state evaluation
Minimax algorithm size restriction
Minimax algorithm with alpha-beta pruning
Alpha-beta pruning variables
Minimax algorithm state value
Minimax algorithm state value
When writing the minimax algorithm, each game involves two players and game states can be evaluated as a value. One of the players is called the maximizer, because he or she wants to maximize the value of the game and the remaining player is called the minimizer.
What you'll create
Portfolio projects that showcase your new skills
How you'll master it
Stress-test your knowledge with quizzes that help commit syntax to memory
Artificial Intelligence Decision Making: Minimax
Start