Search for the best move against the opponent’s best reply.
Minimax is chess with your annoyingly smart cousin. Your move only counts after their nastiest comeback.
It looks ahead through turns, then picks the safest strong move. You meet it in board games and planning with opponents.
Α-β Pruning
Α-β Pruning helps Minimax search faster by skipping useless branches.
MCTS
Minimax and MCTS both choose game moves, but they explore in different ways.
Planning
Minimax is a classic planning method for games with an opponent.
A* Search
Minimax and A* Search both search paths, but A* Search does not plan against an opponent.