Tic Tac Toe AI with Minimax Algorithm
Coding Challenge #154
In this challenge I take the Tic Tac Toe game from coding challenge #149 and add an AI opponent for a human player by implenenting the Minimax algorithm.
Community Contributions
- Impossible TicTacToe Ai by Ikram Hasan (Source Code)
- Tic Tac Toe With Alpha Beta Pruning by Rino Vetha Moses (Source Code)
- Chess AI by Simon Tiger Houben (Source Code)
- Chess AI with customizable search depth by Simon Tiger Houben (Source Code)
- Reversi MiniMax with alpha-beta pruning by Copper France
- Tic Tac Toe MiniMax in python with alpha-beta pruning by David Snyder (Source Code)
- Connect 4 with MiniMax by Kobe Liesenborgs (Source Code)
- Connect 4 with MiniMax and alpha-beta pruning by Kobe Liesenborgs (Source Code)
- minimax that thinks about depth by Yuval bilu (Source Code)
- Tic Tac Toe MiniMax with difficulties by David Snyder (Source Code)
- Tic Tac Toe MiniMax with Angular and Charts by Harald Brabenetz (Source Code)
- Tic Tac Toe MiniMax with Realistic Design by Som Shekhar Mukherjee (Source Code)
- Tic Tac Toe MiniMax in an interactive python console app by Gautam Bhambhani (Source Code)
- Tic Tac Toe MiniMax Galaxy by Anja Khan (Source Code)
- Tic Tac Toe Minimax in Processing by Saraansh Rawat (Source Code)
- Connect 4 with MiniMax with alpha-beta pruning Java by ITEMan Zero (Source Code)
- Chess AI with alpha-beta pruning in javascript by reddragonnm (Source Code)
- TicTacToe MiniMax by Linus Stalder (Source Code)
- Connect 4 - variable difficulty by Linus Stalder (Source Code)
- Animated Tic Tac Toe by Abhishek Choudhary (Source Code)
- Best of 3 Tic Tac Toe by Gilmar Andrade (Source Code)
You can also add your own version! (See how)
Links discussed in this coding challenge
Videos discussed in this coding challenge
- Algorithms Explained - minimax and alpha-beta pruning by Sebastian Lague
- Coding Challenge #149: Tic Tac Toe by The Coding Train