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.
468 stars. No commits in the last 6 months.
Use this if you are developing a two-player, turn-based game and want to add an AI opponent that always makes the best possible move.
Not ideal if you are developing a game with many possible moves or complex states, as the full search could be computationally too expensive.
Stars
468
Forks
255
Language
Python
License
GPL-3.0
Category
Last pushed
Dec 27, 2023
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Cledersonbc/tic-tac-toe-minimax"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Compare
Related frameworks
LazoVelko/Tic-Tac-Toe
An unbeatable game of Tic Tac Toe.
GantMan/tictactoe-ai-tfjs
Train your own TensorFlow.js Tic Tac Toe
mscroggs/MENACE
Machine Educable Noughts And Crosses Engine
jamesq9/Tic-Tac-Toe-Machine-Learning-Using-Reinforcement-Learning
A Python Program to implement Machine Learning for the Game Tic Tac Toe (3x3) using...
grimmerk/alphago-zero-tictactoe-js
A TypeScript game framework based on AlphaZero/TensorFlow.js runs in browser to demonstrate...