Cledersonbc/tic-tac-toe-minimax
A Python implementation of the Minimax algorithm enabling an AI to play Tic-Tac-Toe optimally.
Not currently ranked — collecting fresh signals.
star history
This repository provides a working implementation of the Minimax algorithm applied to Tic-Tac-Toe. The algorithm recursively explores the game tree, alternating between maximizing and minimizing players, to determine the optimal move. It demonstrates fundamental AI concepts including game state representation, minimax decision-making, and terminal state evaluation with win/loss/draw outcomes.
Frequently asked
- What is Cledersonbc/tic-tac-toe-minimax?
- A Python implementation of the Minimax algorithm enabling an AI to play Tic-Tac-Toe optimally.
- Is tic-tac-toe-minimax open source?
- Yes — Cledersonbc/tic-tac-toe-minimax is open source, released under the GPL-3.0 license.
- What language is tic-tac-toe-minimax written in?
- Cledersonbc/tic-tac-toe-minimax is primarily written in Python.
- How popular is tic-tac-toe-minimax?
- Cledersonbc/tic-tac-toe-minimax has 469 stars on GitHub.
- Where can I find tic-tac-toe-minimax?
- Cledersonbc/tic-tac-toe-minimax is on GitHub at https://github.com/Cledersonbc/tic-tac-toe-minimax.