Workflowunbeatable-tictactoe
Unbeatable Tic-Tac-Toe
A tic-tac-toe game with an unbeatable AI opponent using the minimax algorithm with alpha-beta pruning.
stack
- Python
Architecture
- Minimax search — exhaustive game-state exploration for the optimal move; AI never loses
- Alpha-beta pruning — skips branches that can't affect the decision; ~60% fewer nodes explored
- Move ordering — center, then corners, then edges
- Terminal UI — command-line human vs. AI gameplay
Results
- Mathematically unbeatable — AI always wins or draws
- Alpha-beta pruning for instant response times
Action · Send message
Hiring for a remote AI engineering role?
Contact me