tic-tac-toe-minimax and AI-Tic-Tac-Toe

tic-tac-toe-minimax
51
Established
AI-Tic-Tac-Toe
33
Emerging
Maintenance 0/25
Adoption 10/25
Maturity 16/25
Community 25/25
Maintenance 0/25
Adoption 5/25
Maturity 16/25
Community 12/25
Stars: 468
Forks: 255
Downloads:
Commits (30d): 0
Language: Python
License: GPL-3.0
Stars: 11
Forks: 2
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 AI-Tic-Tac-Toe

MuskanPaliwal/AI-Tic-Tac-Toe

Contains step-by-step creation of an Artificial Bot that plays Tic-Tac-Toe intelligently.

This project provides an AI opponent for the game Tic-Tac-Toe. It takes your moves as input and produces an optimal counter-move, ensuring the AI either wins or draws. It's designed for anyone interested in experiencing or understanding how basic game AI works, especially for perfect information games.

game-AI board-games game-strategy minimax-algorithm reinforcement-learning

Scores updated daily from GitHub, PyPI, and npm data. How scores work