Minimax game solver
A Python implementation of minimax over a two-player game tree with terminal-node evaluation.
This project implements minimax over a small two-player game tree. It is a classic algorithm, but it is still worth showing because the implementation reveals the shape of adversarial decision-making.
| Concept | Implementation role | Outcome |
|---|---|---|
| Terminal nodes | Final game values | Ground truth for the search. |
| Recursion | Walks the tree | Propagates value upward. |
| Max/min turns | Alternating players | Models adversarial choice. |
It belongs in the Lab as a compact algorithm artifact, not as a full case study.
Repository: game-theory-minimax.