🎮 Connect Four

📚 What is the Minimax Algorithm?

Minimax is a decision-making algorithm used in game AI. It works by simulating all possible moves ahead, assuming both players play optimally. It "minimizes the maximum possible loss" - hence "minimax". This implementation includes alpha-beta pruning for efficiency.

How it works:

• Explores the game tree to a certain depth
• Evaluates board positions (winning positions = high score)
• Assumes opponent will make the best possible move
• Chooses the move that maximizes AI's minimum guaranteed score
• Alpha-beta pruning eliminates unnecessary branches

Applications: Chess engines, checkers, tic-tac-toe, game theory, decision making