tic-tac-toe-minimax and Tictactoe-Bot
Maintenance
0/25
Adoption
10/25
Maturity
16/25
Community
25/25
Maintenance
2/25
Adoption
3/25
Maturity
16/25
Community
12/25
Stars: 468
Forks: 255
Downloads: —
Commits (30d): 0
Language: Python
License: GPL-3.0
Stars: 3
Forks: 1
Downloads: —
Commits (30d): 0
Language: Python
License: MIT
Stale 6m
No Package
No Dependents
Stale 6m
No Package
No Dependents
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.
game-development
board-games
game-AI
turn-based-games
perfect-information-games
About Tictactoe-Bot
Liburn-Krasniqi/Tictactoe-Bot
Tic-tac-toe game in python, using pygame. (with AI adversary)
Related comparisons
Scores updated daily from GitHub, PyPI, and npm data. How scores work