The minimax algorithm is one of the oldest artificial intelligence algorithms ever. It uses a simple zero sum rule to find which player will win from a current position.
This is arguably the most powerful and basic tool for building game playing artificial intelligence. It captures the intentions of two player games fighting against one another. Minimax is the foundation for algorithms like alpha-beta pruning and iterative deepening.
Engines like deep blue use optimized versions of minimax to play chess, while other computer programs have also been successful at playing games with minimax.
Source Code (Complicated, glance over the evaluate function to get a gist):
[ Ссылка ]
00:00 Basic Game Tree
01:17 Basic Algorithm - Winning
03:42 Heuristics
06:40 Benefits of Heuristics
07:34 Thank you!
#minimax #minmax #game-tree
