tic-tac-toe-minimax and Tic-Tac-Toe-AI
About tic-tac-toe-minimax
Cledersonbc/tic-tac-toe-minimax
Minimax is a AI algorithm.
This project helps game developers implement an unbeatable AI opponent in two-player, perfect information games like Tic-Tac-Toe. By providing the current game board state, it calculates and returns the optimal next move for the AI. This is ideal for developers creating simple board games and looking for a way to make their computer opponent always play perfectly.
About Tic-Tac-Toe-AI
GeorgeSeif/Tic-Tac-Toe-AI
A tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning
This program provides an unbeatable Tic-Tac-Toe opponent, allowing you to play against an AI that guarantees it will never lose. You input your moves on the board, and the AI responds with its best possible move, ensuring at least a draw. This is for anyone looking for a challenging Tic-Tac-Toe opponent or to demonstrate game AI principles.
Related comparisons
Scores updated daily from GitHub, PyPI, and npm data. How scores work