The Minimax algorithm is a decision-making strategy used in two-player, zero-sum, perfect-information games. It ensures that the MAX player makes the best possible move, assuming that the MIN player also plays optimally.
The game is represented as a tree where:
- Nodes = game states
- Edges = possible moves
- Leaf nodes = terminal states (win/loss/draw)